Forcing total outer connected monophonic number of a graph

DOI10.18500/1816-9791-2022-22-3-278-286zbMATH Open1504.05214OpenAlexW4293548269MaRDI QIDQ5040936FDOQ5040936

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)

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

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

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)

Cited In (6)

• Forcing total detour monophonic sets in a graph
• The forcing open monophonic number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total and forcing total edge-to-vertex monophonic number of 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)