One-factor resolvability of grid derived networks

zbMATH Open1248.68387MaRDI QIDQ3166155FDOQ3166155

Authors: Sonia K. Thomas, Chris Monica M, Bharati Rajan 

Publication date: 21 October 2012

Recommendations

• Conditional resolvability of honeycomb and hexagonal networks
• On certain resolving parameters of tree derived architectures
• Minimum weight resolving sets of grid graphs
• Certain varieties of resolving sets of a graph
• One size resolvability of graphs

zbMATH Keywords

grid derived networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Network design and communication in computer systems (68M10)

Cited In (1)

• Conditional resolvability of honeycomb and hexagonal networks

This page was built for publication: One-factor resolvability of grid derived networks

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