scientific article; zbMATH DE number 437479

MaRDI QIDQ3140345zbMATH OpenFDO

Authors Dinakar K Patwari, V. R. Kulli

Publication date 13 April 1994

zbMATH Keywords

total edge domatic numbertotal edge domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On n-total edge domination number in graphs
• Edge domination and total edge domination in the corona of graphs
• On signed edge total domination numbers of graphs
• Properties of total domination edge-critical graphs
• Total domination critical and stable graphs upon edge removal

Cited in

(27)

• On bondage numbers of graphs: a survey with some comments
• Some progress on total bondage in graphs
• The complexity of total edge domination and some related results on trees
• Complexity and characterization aspects of edge-related domination for graphs
• The total bondage numbers and efficient total dominations of vertex-transitive graphs
• Signed total Roman edge domination in graphs
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• Domination parameters in coronene torus network
• Complexity and bounds for disjunctive total bondage
• Effects of edge lifting on domination in graphs
• Maximal matching and edge domination in complete multipartite graphs
• On the algorithmic complexity of edge total domination
• On n-total edge domination number in graphs
• The disjunctive bondage number and the disjunctive total bondage number of graphs
• On the complexity of the bondage and reinforcement problems
• Correlation of domination parameters with physicochemical properties of octane isomers
• scientific article; zbMATH DE number 929717 (Why is no real title available?)
• Introduction to dominated edge chromatic number of a graph
• Bounds on total edge domination number of a tree
• Semitotal bondage numbers of graphs
• Edge domination and total edge domination in the corona of graphs
• The \(k\)-power bondage number of a graph
• Algorithms and hardness results for edge total domination problem in graphs
• Nordhaus-Gaddum-type results on the connected edge domination number
• On the total domination number of total graphs
• The total bondage number of grid 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 Q3140345)