Local Distance Pattern Distinguishing Sets in Graphs

DOI10.1007/978-3-030-01123-9_51zbMath1442.05052OpenAlexW2912521137MaRDI QIDQ3296834

R. Anantha Kumar

Publication date: 2 July 2020

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

Full work available at URL: https://doi.org/10.1007/978-3-030-01123-9_51

zbMATH Keywords

local metric setLDPD-numberLDPD-set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

Structural characterization of some family of local distance pattern distinguishing graphs

Cites Work

• Connected Resolvability of Graphs
• Domination and location in acyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local Distance Pattern Distinguishing Sets in Graphs