Imagen de Portada

On the number of minimal forts of a graph

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Becker, Paul, Cameron, Thomas R., Hanely, Derek, Ong, Boon, Previte, Joseph P.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C15 (Primary) 05C30, 05C35, 05C50, 05C57, 05C76, 90C35 (Secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the forts and related parameters of the hypercube graph
por: Brimkov, Boris, et al.
Publicado: (2025)

On the minimal forts of trees
por: Cameron, Thomas R., et al.
Publicado: (2025)

Spectral approaches for $d$-improper chromatic number
por: Guo, Krystal, et al.
Publicado: (2024)

4-cop-win graphs have at least 19 vertices
por: Turcotte, Jérémie, et al.
Publicado: (2020)

Full classification of anti-van der Waerden numbers of graph products of forests
por: Berikkyzy, Zhanar, et al.
Publicado: (2025)

Number of independent transversals in multipartite graphs
por: Tang, Yantao, et al.
Publicado: (2025)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
por: Cameron, Thomas R., et al.
Publicado: (2025)

Extremal diameters of 3-coloring graphs of trees
por: Asgarli, Shamil, et al.
Publicado: (2025)

Graphs with Independent Exact $r$-covers for all $r$
por: Chau, Hou Tin
Publicado: (2025)

Connected forcing density and related problems
por: Brimkov, Boris, et al.
Publicado: (2025)

A sharp spectral extremal result for general non-bipartite graphs
por: Byrne, John
Publicado: (2024)

Ratio of the number of $\mathbf{1}$-nearly independent vertex subsets and the Merrifield-Simmons index
por: Dossou-Olory, Audace A. V., et al.
Publicado: (2026)

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
por: Steinke, Finn A., et al.
Publicado: (2026)

Isospectral Cayley graphs with even and odd spectrum
por: Chiapparoli, Paula M., et al.
Publicado: (2026)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
por: Polavarapu, Achintya Raya
Publicado: (2026)

On the Extremal Energy of Complex Unit Gain Dumbbell Graphs
por: Huang, Silin, et al.
Publicado: (2026)

Sharp $A_α$-Spectral Conditions for Odd $[1,b]$-Factors When $α>1/2$
por: Huang, Silin
Publicado: (2026)

Inertia, Independence and Expanders
por: Tang, Quanyu, et al.
Publicado: (2025)

Table of large graphs with given degree and diameter
por: Comellas, Francesc
Publicado: (2024)

The Number of Spanning Trees for The Generalized Cones of $K_n$, The Generalized Half Cones of $K_{m,n}$ and Some Family of Modified $K_{m,n}$
por: Cinkir, Zubeyir
Publicado: (2024)

On the Maximum Number of Spanning Trees in $C_4$-Free Graphs
por: London, András
Publicado: (2026)

On cores of distance-regular graphs
por: Geertsema, Annemarie, et al.
Publicado: (2025)

Bicyclic graphs with the smallest and largest numbers of connected sets
por: Dossou-Olory, Audace A. V.
Publicado: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025)

Hoffman-London graphs: When paths minimize $H$-colorings among trees
por: Galvin, David, et al.
Publicado: (2025)

On Inversion Graphs of Permutations
por: Mandrick, Sean
Publicado: (2025)

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
por: Anastos, Michael, et al.
Publicado: (2023)

The $S$-packing coloring of the infinite diagonal grid with $S = (1,6,6,\ldots)$
por: Kittipassorn, Teeradej, et al.
Publicado: (2025)

Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs
por: Carter, Daniel, et al.
Publicado: (2026)

Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
por: Desai, Dheer Noal, et al.
Publicado: (2025)

Throttling for standard zero forcing on directed graphs
por: Cairncross, Emily, et al.
Publicado: (2020)

Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult
por: Acharya, Hricha, et al.
Publicado: (2024)

Cubic graphs with no eigenvalues in the interval (-1,1)
por: Guo, Krystal, et al.
Publicado: (2024)

Turán number of books in non-bipartite graphs
por: Miao, Lu, et al.
Publicado: (2025)

Integral Laplacian graphs with a unique double Laplacian eigenvalue, I
por: Hameed, Abdul, et al.
Publicado: (2022)

Path-Minimality of $p$-Energy for Connected Graphs
por: Liu, Yinchen, et al.
Publicado: (2026)

Triangle Families with Large Edge Up-Laplacian Spectral Gap
por: Mim, Mutasim
Publicado: (2026)

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
por: Andriantiana, Eric O. D., et al.
Publicado: (2026)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
por: Adauto, Matheus, et al.
Publicado: (2023)

Long paths need not minimize $H$-colorings among trees
por: Galvin, David, et al.
Publicado: (2025)