Independent double monophonic domination number of a graph

MaRDI QIDQ3390964zbMATH OpenFDO

Authors A. Sadiquali, P. Arul Paul Sudhahar

Publication date 25 March 2022

Full work available at URL http://fairpartners.ro/upload_poze_documente/files/volume%2015(2022)%2C%20no.%201/9_Sadiquali.pdf

zbMATH Keywords

monophonic domination numberdouble monophonic numberdouble monophonic domination numberindependent double monophonic domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• On the \((M, D)\) number of a graph
• Upper double monophonic number of a graph
• Characterization of upper detour monophonic domination number
• Restrained double monophonic number of a graph
• Connected monophonic domination in graphs

Cited in

(2)

• Connected monophonic domination in graphs
• On the \((M, D)\) number of a graph

This page was built for publication: Independent double monophonic domination number of a graph

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