Superlative total domination in graphs

DOI10.21608/EJMAA.2024.220095.1043MaRDI QIDQ6598257

Veena Bankapur, B. Chaluvaraju

Publication date: 4 September 2024

Published in: Electronic Journal of Mathematical Analysis and Applications EJMAA (Search for Journal in Brave)

zbMATH Keywords

dominationtotal dominationinverse dominationmaximal total dominationsuperlative total domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of selected recent results on total domination in graphs
• Inverse domination in graphs
• Total and paired-domination numbers of a tree
• Generalized perfect domination in graphs
• Inverse total domination in graphs
• Total domination in graphs
• Towards a theory of domination in graphs
• Graphs with large total domination number
• Total Domination in Graphs
• Complementary total domination in graphs

This page was built for publication: Superlative total domination in graphs

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