The partition dimension of strong product graphs and Cartesian product graphs

DOI10.1016/J.DISC.2014.04.026zbMATH Open1297.05187OpenAlexW2080429737MaRDI QIDQ397144FDOQ397144

Authors: Ismael G. Yero, Marko Jakovac, Dorota Kuziak, Andrej Taranenko 

Publication date: 8 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.026

Recommendations

• A note on the partition dimension of Cartesian product graphs
• On the strong partition dimension of graphs
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• Partition dimension of rooted product graphs
• On a product dimension of bipartite graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• Arbitrary partitionability of product graphs
• The metric dimension of strong product graphs
• On the strong metric dimension of the strong products of graphs
• On the strong metric dimension of product graphs

zbMATH Keywords

Cartesian product graphsstrong product graphsgraphs partitioningpartition dimensionresolving partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Resolvability in graphs and the metric dimension of a graph
• On the metric dimension of some families of graphs
• Resolvability and the upper dimension of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Landmarks in graphs
• Title not available (Why is that?)
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• A note on the partition dimension of Cartesian product graphs
• On the metric dimension of corona product graphs
• Title not available (Why is that?)
• The partition dimension of a graph
• The partition dimension of Cayley digraphs
• Discrepancies between metric dimension and partition dimension of a connected graph

Cited In (17)

• A method to construct graphs with certain partition dimension
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• On some resolving partitions for the lexicographic product of two graphs
• On Extremal Set Partitions in Cartesian Product Spaces
• A note on the partition dimension of Cartesian product graphs
• The partition dimension of circulant graphs
• Resolving dominating partitions in graphs
• Partition dimension of rooted product graphs
• Title not available (Why is that?)
• The optimal strong radius and optimal strong diameter of the Cartesian product graphs
• Further new results on strong resolving partitions for graphs
• On the partition dimension of two-component graphs
• Neighbor-locating colorings in graphs
• Link dimension and exact construction of graphs from distance vectors
• Decomposition dimension of Cartesian product of some graphs
• Partition dimension of certain classes of series parallel graphs
• On the \(k\)-partition dimension of graphs

This page was built for publication: The partition dimension of strong product graphs and Cartesian product graphs

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