scientific article
From MaRDI portal
Publication:3140345
zbMath0785.05055MaRDI QIDQ3140345
Dinakar K Patwari, Veerabhadra R. Kulli
Publication date: 13 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
On the algorithmic complexity of edge total domination ⋮ The k-power bondage number of a graph ⋮ The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs ⋮ Maximal matching and edge domination in complete multipartite graphs ⋮ Complexity and bounds for disjunctive total bondage ⋮ Signed total Roman edge domination in graphs ⋮ On the complexity of the bondage and reinforcement problems ⋮ Correlation of domination parameters with physicochemical properties of octane isomers ⋮ Algorithms and hardness results for edge total domination problem in graphs ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ Unnamed Item ⋮ The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs ⋮ Some progress on total bondage in graphs ⋮ The total bondage number of grid graphs ⋮ The complexity of total edge domination and some related results on trees ⋮ Complexity and characterization aspects of edge-related domination for graphs ⋮ Domination parameters in coronene torus network ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ Introduction to dominated edge chromatic number of a graph ⋮ Bounds on total edge domination number of a tree
This page was built for publication:
