The connected and forcing connected restrained monophonic numbers of a graph

DOI10.22199/ISSN.0717-6279-5390MaRDI QIDQ6563262zbMATH OpenFDO

Authors A. P. Santhakumaran, P. Titus, K. Ganesamoorthy

Publication date 27 June 2024

Published in Proyecciones (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

monophonic setrestrained monophonic setconnected restrained monophonic setforcing connected restrained monophonic set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Minimal connected restrained monophonic sets in graphs
• The connected restrained edge monophonic number of a graph
• scientific article; zbMATH DE number 7059463
• Restrained double monophonic number of a graph
• scientific article; zbMATH DE number 7511520

Cites work

• scientific article; zbMATH DE number 38308 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 7511520 (Why is no real title available?)
• scientific article; zbMATH DE number 2192101 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Algorithmic Aspects of Monophonic Convexity
• Extreme restrained monophonic graphs.
• Monophonic numbers of the join and composition of connected graphs
• On the geodetic number of a graph
• On the monophonic number of a graph
• The connected monophonic number of a graph
• The geodetic number of a graph
• The restrained geodetic number of a graph

This page was built for publication: The connected and forcing connected restrained monophonic numbers of a graph

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