Cover Image

Independent Bondage Number in Graphs under Girth Constraints

Fuente: arXiv

Saved in:

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

Similar Items

On Total Bondage Number of Graphs
by: Gamlath, E. G. K. M., et al.
Published: (2024)

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

The $k$-Total Bondage Number of a Graph
by: Appel, Jean-Pierre, et al.
Published: (2025)

On the Girth of Graph Lifts
by: Hoory, Shlomo
Published: (2024)

Defective and Clustered Colouring of Graphs with Given Girth
by: Briański, Marcin, et al.
Published: (2024)

Independent Domination of k-Trees
by: Pham, Andrew
Published: (2024)

Graphs with Large Girth and Small Cop Number
by: Clow, Alexander
Published: (2023)

Diameter and Girth of Representation Graphs of Quadratic Forms
by: Lorenz, Nico, et al.
Published: (2025)

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

On Mixed Cages of Girth 6
by: Araujo-Pardo, Gabriela, et al.
Published: (2024)

Girth and Laplacian eigenvalue distribution
by: Xu, Leyou, et al.
Published: (2025)

Girth in $GF(q)$-representable matroids
by: Davies, James, et al.
Published: (2025)

A Note on Mixed Cages of Girth 5
by: Araujo-Pardo, Gabriela, et al.
Published: (2025)

Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs
by: Schuerger, Houston, et al.
Published: (2024)

On the Structure of Hamiltonian Graphs with Small Independence Number
by: Jedličková, Nikola, et al.
Published: (2024)

The Linear Arboricity Conjecture for Graphs with Large Girth
by: Mishra, Tapas Kumar
Published: (2025)

Rainbow Turán numbers for short brooms
by: Byrne, John, et al.
Published: (2025)

High-Girth Steiner Triple Systems
by: Kwan, Matthew, et al.
Published: (2022)

Bounding the Eviction Number of a Graph in Terms of its Independence Number
by: MacGillivray, Gary, et al.
Published: (2025)

Number of Independent Sets in Regular and Irregular Graphs: A 31 Year Journey
by: Chheda, Dev, et al.
Published: (2024)

Two-Point Concentration of the Independence Number of the Random Graph
by: Bohman, Tom, et al.
Published: (2022)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)

Geochromatic Number when Crossings are Independent
by: Boutin, Debra, et al.
Published: (2024)

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
by: Aldi, Marco, et al.
Published: (2025)

New Bounds on the Anti-Ramsey Number of Independent Triangles
by: Lu, Hongliang, et al.
Published: (2025)

Tree Independence Number IV. Even-hole-free Graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

A note on the Ratio and Inertia Bounds for the $k$-Independence Number
by: Gao, Jun, et al.
Published: (2026)

Bounds on Independent Isolation in Graphs
by: Boyer, Geoffrey, et al.
Published: (2025)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
by: Galby, Esther, et al.
Published: (2023)

Outer Independent Roman Domination Number of Cartesian Product of Paths and Cycles
by: Gao, Hong, et al.
Published: (2024)

On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)

Proof of the High Girth Existence Conjecture via Refined Absorption
by: Delcourt, Michelle, et al.
Published: (2024)

An Asymptotically Sharp Bound on the Maximum Number of Independent Transversals
by: Ruotolo, Jake, et al.
Published: (2022)

On The Number Of Labeled Bipartite Graphs
by: Atmaca, Abdullah, et al.
Published: (2024)

Computing Tree Decompositions with Small Independence Number
by: Dallard, Clément, et al.
Published: (2022)

Ramsey Numbers in Kneser Graphs
by: Heath, Emily, et al.
Published: (2025)

On Independent Spanning Trees in Random and Pseudorandom Graphs
by: Draganić, Nemanja, et al.
Published: (2025)

Extremal Mostar Index of Graphs with Given Number of Cut Edges
by: Hosamani, Sunilkumar M.
Published: (2026)

Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Anti-Ramsey Number of Friendship Graphs
by: Liu, Wenke, et al.
Published: (2024)