scientific article; zbMATH DE number 6769542

MaRDI QIDQ5354867zbMATH OpenFDO

Authors Ahmed Mohammed Naji, N. D. Soner

Publication date 5 September 2017

Full work available at URL http://www.ijaamm.com/uploads/2/1/4/8/21481830/v4n2p5_44-51.pdf

zbMATH Keywords

monopoly partitionmonopoly setmonotic numberNordhaus-Gaddum inequalities

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the monophonic number of a graph
• The mono-number of a graph
• On the nonsplit monophonic number of a graph
• The connected monophonic number of a graph
• On the edge monophonic number of a graph
• On monoid graphs
• On the monophonic rank of a graph
• The vertex monophonic number of a graph
• On the detour monophonic number of a graph.
• scientific article; zbMATH DE number 5904664

Cited in

(5)

• On the number of edges not covered by monochromatic copies of a fixed graph.
• Independent monopoly size in graphs
• Partitioning a graph into monopoly sets
• On the monopoly of graphs
• Monophonic graphoidal covering number of corona product graphs

This page was built for publication:

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