MONOPHONIC DISTANCE IN GRAPHS

DOI10.1142/S1793830911001176zbMath1222.05043OpenAlexW2094865676MaRDI QIDQ3087091

A. P. Santhakumaran, P. Titus

Publication date: 2 August 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830911001176

zbMATH Keywords

distancemonophonic distancemonophonic centermonophonic diametermonophonic eccentricitymonophonic radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (17)

The connected vertex detour monophonic number of a graph ⋮ A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS" ⋮ The forcing vertex detour monophonic number of a graph ⋮ Upper triangle free detour number of a graph ⋮ Extreme-support total monophonic graphs ⋮ Monophonic pebbling number and t-pebbling number of some graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Total and forcing total edge-to-vertex monophonic number of a graph ⋮ Clique-to-vertex monophonic distance in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edge-to-vertex m-detour monophonic number of a graph ⋮ The total detour monophonic number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edge fixed monophonic number of a graph ⋮ Minimal connected restrained monophonic sets in graphs

Cites Work

• Unnamed Item
• Graphs with specified radius and diameter
• The dissimilarity characteristic of Husimi trees

This page was built for publication: MONOPHONIC DISTANCE IN GRAPHS