Cover Image

On Total Bondage Number of Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gamlath, E. G. K. M., Wei, Bing
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C35 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graph Configurations and Independent Bondage Numbers of Planar Graphs
by: Gamlath, E. G. K. M., et al.
Published: (2024)

Maximum number of edge colorings avoiding rainbow copies of $K_4$
by: Hàn, Hiêp, et al.
Published: (2025)

Almost regular subgraphs under spectral radius constrains
by: Xu, Weilun, et al.
Published: (2024)

The sufficient conditions for $k$-leaf-connected graphs in terms of several topological indices
by: Ma, Tingyan, et al.
Published: (2023)

Secure Total Domination Number in Maximal Outerplanar Graphs
by: Aita, Yasufumi, et al.
Published: (2024)

Notes on embedding trees in graphs with O(|T|)-sized covers
by: Pokrovskiy, Alexey
Published: (2024)

On the distance signless Laplacian spectral radius, fractional matching and factors of graphs
by: Zhang, Z. H., et al.
Published: (2025)

Tiling dense hypergraphs
by: Lang, Richard
Published: (2023)

On Mixed Cages
by: Exoo, Geoffrey
Published: (2022)

Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic
by: Carr, Avery
Published: (2026)

On the characterization of graphs with tree 3-spanners
by: Lin, Lan, et al.
Published: (2025)

Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
by: Carr, Avery
Published: (2025)

Exact Values and Bounds for Ramsey Numbers of $C_4$ Versus a Star Graph
by: Boza, Luis
Published: (2024)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
by: Buslov, Vasily
Published: (2025)

When a forest, narrowed to an atom of subset algebra, turns out to be a tree
by: Buslov, Vasily
Published: (2025)

Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
by: Buslov, Vasily
Published: (2025)

How Trees on Atoms of Subset Algebras Define Minimal Forests and Their Growth
by: Buslov, Vasily
Published: (2025)

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
by: Buslov, V. A.
Published: (2025)

On problems in extremal multigraph theory
by: Falgas-Ravry, Victor, et al.
Published: (2025)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
by: Babu, Anand, et al.
Published: (2026)

On the Alon-Tarsi Number of Some Line and Total graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Treewidth, Hadwiger Number, and Induced Minors
by: Campbell, Rutger, et al.
Published: (2024)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)

The partial gossip problem revisited
by: Kokhas, Konstantin, et al.
Published: (2026)

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
by: Benevides, Fabrício Siqueira, et al.
Published: (2024)

A Lower bound for Secure Domination Number of an Outerplanar Graph
by: Araki, Toru
Published: (2024)

Slavic Techniques for Hat Guessing Algorithms
by: McInnis, I. M. J.
Published: (2025)

Coloring Graphs With No Totally Odd Clique Immersion
by: McFarland, Caleb
Published: (2025)

Hyperstability in the Erdős-Sós Conjecture
by: Pokrovskiy, Alexey
Published: (2024)

Topological Indices Among Strong Support Vertex
by: Hamoud, Jasem, et al.
Published: (2025)

On Topological Indices in Trees: Fibonacci Degree Sequences and Bounds
by: Hamoud, Jasem, et al.
Published: (2025)

Degree Sequence of Albertson and $σ$-Indices on Trees of Order $n\geqslant 3$
by: Hamoud, Jasem, et al.
Published: (2025)

Bounds on Trees with Topological Indices Among Degree Sequence
by: Hamoud, Jasem, et al.
Published: (2025)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Bounds and Hardness Results for Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2024)

Geometrization of Graphs: Towards Bounding the Chromatic Number via High-Dimensional Embedding
by: Fang, Qiming, et al.
Published: (2024)

The Generalized Sylvester's And Orchard Problems Via Discriminantal arrangement
by: Das, Pragnya, et al.
Published: (2022)