A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS"
From MaRDI portal
Publication:3166729
DOI10.1142/S1793830912500188zbMath1251.05049OpenAlexW1972613948MaRDI QIDQ3166729
Publication date: 15 October 2012
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830912500188
distancemonophonic distancemonophonic centermonophonic diametermonophonic eccentricitymonophonic radius
Related Items (14)
Subbasic open sets in graphs generated by monophonic eccentric neighborhoods ⋮ The connected vertex detour monophonic number of a graph ⋮ The forcing vertex detour monophonic number of a graph ⋮ Extreme-support total monophonic graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Unnamed Item ⋮ The connected monophonic number of a graph ⋮ 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
This page was built for publication: A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS"