English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In a graph G, the cardinality of the smallest ordered set of vertices thatdistinguishes every element of V (G)[E(G) is called the mixed metric dimensionof G. In this paper we first establish the exact value of the mixed metricdimension of a unicycic graph G which is derived from the structure of G. Wefurther consider graphs G with edge disjoint cycles in which a unicyclicrestriction Gi is introduced for each cycle Ci: Applying the result forunicyclic graph to each Gi then yields the exact value of the mixed metricdimension of such a graph G. The obtained formulas for the exact value of themixed metric dimension yield a simple sharp upper bound on the mixed metricdimension, and we conclude the paper conjecturing that the analogous boundholds for general graphs with prescribed cyclomatic number.

Mixed metric dimension of graphs with edge disjoint cycles