Total bondage number of a graph

From MaRDI portal

Revision as of 01:30, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2474670

Jump to:navigation, search

zbMath1135.05056MaRDI QIDQ2474670

V. S. A. Subramanian, M. D. Elias, N. S. Sridharan

Publication date: 6 March 2008

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Complexity and bounds for disjunctive total bondage ⋮ Quasi-total Roman bondage number in graphs ⋮ On the complexity of the bondage and reinforcement problems ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ NP-hardness of multiple bondage in graphs ⋮ Some progress on total bondage in graphs ⋮ The total bondage number of grid graphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs

This page was built for publication: Total bondage number of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2474670&oldid=15168959"