On the partition dimension of two-component graphs

DOI10.1007/s12044-017-0363-2zbMath1382.05058OpenAlexW2768114246MaRDI QIDQ1693652

Andrea Semaničová-Feňovčíková, D. O. Haryeni, Martin Bača, S. W. Saputro, Edy Tri Baskoro

Publication date: 31 January 2018

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-017-0363-2

zbMATH Keywords

componentdisconnected graphpartition dimension

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

A method to construct graphs with certain partition dimension

Cites Work

• The partition dimension of strong product graphs and Cartesian product graphs
• A note on the partition dimension of Cartesian product graphs
• The partition dimension of a graph
• On the partition dimension of a class of circulant graphs
• Discrepancies between metric dimension and partition dimension of a connected graph
• On the partition dimension of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the partition dimension of two-component graphs