On the path partition dimension of a graph

MaRDI QIDQ4902270zbMATH OpenFDO

Authors Ruxandra Verman

Publication date 14 January 2013

zbMATH Keywords

distanceeccentricitymetric dimensionpartition dimensionpath partition dimensionpath resolving partitionresolving partition

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• On path partition dimension of trees.
• Connected partition dimensions of graphs
• On partition dimension of some cycle-related graphs
• The partition dimension of a graph
• On star partition dimension of trees

Cited in

(11)

• On the partition dimension of two-component graphs
• Partition distance in graphs
• Conditions for graphs to be path partition optimal
• The partition dimension of a graph
• On the k-partition dimension of graphs
• On path partition dimension of trees.
• Connected partition dimensions of graphs
• The connected partition dimension of truncated wheels
• On path partitions of the divisor graph
• Partition dimension of generalized Peterson and Harary graphs
• On the path partition number of 6‐regular graphs

This page was built for publication: On the path partition dimension of a graph

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