The connected and forcing connected restrained monophonic numbers of a graph

DOI10.22199/ISSN.0717-6279-5390zbMATH Open1541.0505MaRDI QIDQ6563262FDOQ6563262

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

Publication date: 27 June 2024

Published in: Proyecciones (Search for Journal in Brave)

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

zbMATH Keywords

monophonic setrestrained monophonic setconnected restrained monophonic setforcing connected restrained monophonic set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the geodetic number of a graph
• The geodetic number of a graph
• Title not available (Why is that?)
• On the monophonic number of a graph
• Title not available (Why is that?)
• Algorithmic Aspects of Monophonic Convexity
• The connected monophonic number of a graph
• Monophonic numbers of the join and composition of connected graphs
• The restrained geodetic number of a graph
• Title not available (Why is that?)
• Extreme restrained monophonic graphs.

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)