The forcing open monophonic number of a graph

DOI10.4067/S0716-09172016000100005zbMATH Open1339.05101OpenAlexW2343055131MaRDI QIDQ2812623FDOQ2812623

Authors: A. P. Santhakumaran, M. Mahendran 

Publication date: 17 June 2016

Published in: Proyecciones (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172016000100005

Recommendations

• The forcing total monophonic number of a graph
• The forcing connected vertex monophonic number of a graph
• The forcing edge monophonic number of a graph
• Forcing total outer connected monophonic number of a graph
• The forcing vertex detour monophonic number of a graph
• The upper open monophonic number of a graph
• scientific article; zbMATH DE number 7722331
• The forcing edge fixing edge-to-vertex monophonic number of a graph
• Total and forcing total edge-to-vertex monophonic number of a graph
• On the forcing hull and forcing monophonic hull numbers of graphs

zbMATH Keywords

monophonic numberforcing monophonic numberforcing open monophonic numberopen monophonic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Graphs with specified radius and diameter
• Title not available (Why is that?)
• Geodomination in graphs
• On geodomination in graphs
• On the open geodetic number of a graph
• The upper open monophonic number of a graph

Cited In (6)

• The forcing connected vertex monophonic number of a graph
• Title not available (Why is that?)
• The forcing edge monophonic number of a graph
• The forcing total monophonic number of a graph
• Forcing total outer connected monophonic number of a graph
• Title not available (Why is that?)

This page was built for publication: The forcing open monophonic number of a graph

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