Forcing total outer connected monophonic number of a graph

DOI10.18500/1816-9791-2022-22-3-278-286MaRDI QIDQ5040936zbMATH OpenOpenAlexFDO

Authors K. Ganesamoorthy, Shanmugam Lakshmi Priya

Publication date 18 October 2022

Published in Izvestiya of Saratov University. Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/isu941

zbMATH Keywords

forcing total outer connected monophonic numberforcing total outer connected monophonic subsettotal outer connected monophonic numbertotal outer connected monophonic set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Recommendations

• The forcing total monophonic number of a graph
• Forcing total detour monophonic sets in a graph
• The forcing connected vertex monophonic number of a graph
• The forcing edge monophonic number of a graph
• The forcing open monophonic number of a graph

Cited in

(6)

• scientific article; zbMATH DE number 7641207 (Why is no real title available?)
• Total and forcing total edge-to-vertex monophonic number of a graph
• The forcing open monophonic number of a graph
• scientific article; zbMATH DE number 7739488 (Why is no real title available?)
• Forcing total detour monophonic sets in a graph
• The forcing total monophonic number of a graph

This page was built for publication: Forcing total outer connected monophonic number of a graph

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