On the partition dimension of two-component graphs
DOI10.1007/S12044-017-0363-2zbMATH Open1382.05058OpenAlexW2768114246MaRDI QIDQ1693652FDOQ1693652
Authors: D. O. Haryeni, Suhadi Wido Saputro, Martin Bača, Andrea Semaničová-Feňovčíková, E. T. 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
Recommendations
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A note on the partition dimension of Cartesian product graphs
- The partition dimension of a graph
- Discrepancies between metric dimension and partition dimension of a connected graph
- The partition dimension of strong product graphs and Cartesian product graphs
- On the partition dimension of trees
- The partition dimension of corona product graphs.
- On the partition dimension of a class of circulant graphs
- Title not available (Why is that?)
- The partition dimension of the corona product of two graphs
- The partition dimension of a complete multipartite graph, a special caterpillar and a windmill
Cited In (5)
This page was built for publication: On the partition dimension of two-component graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693652)