Neighborhood total domination of a graph and its complement

zbMATH Open1344.05109MaRDI QIDQ2820193FDOQ2820193

Authors: Doost Ali Mojdeh, M. R. Sayed Salehi, Mustapha Chellali 

Publication date: 14 September 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p037.pdf

Recommendations

• Bounds on neighborhood total domination in graphs
• Trees with large neighborhood total domination number
• A note on neighborhood total domination in graphs
• scientific article; zbMATH DE number 6902661
• Neighborhood total 2-domination in graphs

zbMATH Keywords

neighborhood total domination number

Mathematics Subject Classification ID

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

Cited In (7)

• Neighborhood and domination polynomials of graphs
• Title not available (Why is that?)
• On the total closed neighbourhood graph of a graph
• Graphs and their complements with equal total domination numbers
• Title not available (Why is that?)
• Neighborhood total 2-domination in graphs
• Algorithm and hardness results on neighborhood total domination in graphs

This page was built for publication: Neighborhood total domination of a graph and its complement

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