Simultaneous resolvability in families of corona product graphs

DOI10.1007/S40840-016-0412-5MaRDI QIDQ723627zbMATH OpenOpenAlexFDO

Authors Yunior Ramírez-Cruz, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

Publication date 24 July 2018

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.05667

zbMATH Keywords

simultaneous metric dimensionsimultaneous adjacency dimensioncorona product

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Let $calG$ be a graph family defined on a common vertex set $V$ and let $d$ be a distance defined on every graph $GincalG$. A set $SsubsetV$ is said to be a simultaneous metric generator for $calG$ if for every $GincalG$ and every pair of different vertices $u,vinV$ there exists $sinS$ such that $d(s,u)ed(s,v)$. The simultaneous metric dimension of $calG$ is the smallest integer $k$ such that there is a simultaneous metric generator for $calG$ of cardinality $k$. We study the simultaneous metric dimension of families composed by corona product graphs. Specifically, we focus on the case of two particular distances defined on every $GincalG$, namely, the geodesic distance $d_G$ and the distance $d_{G,2}:VimesVightarrowmathbbNcup0$ defined as $d_{G,2}(x,y)=min{d}_G(x,y),2$.

Recommendations

• Simultaneous resolvability in graph families
• The simultaneous metric dimension of families composed by lexicographic product graphs
• The simultaneous metric dimension of graph families
• The simultaneous strong metric dimension of graph families
• On the metric dimension of corona product graphs

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Closed formulae for the local metric dimension of corona product graphs
• Coloring, location and domination of corona graphs
• Domination and location in acyclic graphs
• Equitable coloring of corona products of graphs
• Factor domination in graphs
• Notions of metric dimension of corona products: combinatorial and computational results
• On a new class of codes for identifying vertices in graphs
• On classes of regular graphs with constant metric dimension
• On the Randić index of corona product graphs
• On the corona of two graphs
• On the metric dimension of corona product graphs
• On the strong metric dimension of corona product graphs and join graphs
• Resolving domination in graphs
• Simultaneous resolvability in graph families
• Studying the corona product of graphs under some graph invariants
• The Szeged, vertex PI, first and second Zagreb indices of corona product of graphs
• The k-metric dimension of corona product graphs
• The irregularity of graphs under graph operations
• The metric dimension of the lexicographic product of graphs
• The simultaneous metric dimension of graph families
• The terminal Hosoya polynomial of some families of composite graphs
• Toughness of the corona of two graphs
• Weighted PI index of corona product of graphs

Cited in

(4)

• On the k-partition dimension of graphs
• Simultaneous resolvability in graph families
• The simultaneous metric dimension of families composed by lexicographic product graphs
• The simultaneous metric dimension of graph families

This page was built for publication: Simultaneous resolvability in families of corona product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723627)