Publication:3140345
From MaRDI portal
zbMath0785.05055MaRDI QIDQ3140345
Dinakar K Patwari, Veerabhadra R. Kulli
Publication date: 13 April 1994
05C35: Extremal problems in graph theory
Related Items
Correlation of domination parameters with physicochemical properties of octane isomers, Unnamed Item, Introduction to dominated edge chromatic number of a graph, Bounds on total edge domination number of a tree, 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 algorithmic complexity of edge total domination, On the complexity of the bondage and reinforcement problems, The total bondage number of grid graphs, 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, Maximal matching and edge domination in complete multipartite graphs, The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs
