Imagen de Portada

Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Li, Peishan
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Distance signless Laplacian spectral radius and tough graphs involving minimun degree
por: Liu, Xiangge, et al.
Publicado: (2025)

On the existence of minimally tough graphs having large minimum degrees
por: Hasanvand, Morteza
Publicado: (2025)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
por: Liu, Xiangge, et al.
Publicado: (2025)

Sufficient conditions for spanning $k$-trees in tough graphs
por: Jia, Caili, et al.
Publicado: (2026)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
por: Zhong, Jiaxu, et al.
Publicado: (2026)

Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
por: Zhang, Zhenhao, et al.
Publicado: (2026)

A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
por: Shan, Songling, et al.
Publicado: (2025)

Scattering number and $τ$-toughness in graphs involving $A_α$-spectral radius
por: Jia, Caili, et al.
Publicado: (2025)

Sufficient conditions for a graph with minimum degree to have a component factor
por: Wu, Jie
Publicado: (2025)

A spectral condition for Hamilton cycles in tough bipartite graphs
por: Ai, Lianyang, et al.
Publicado: (2025)

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
por: Xu, Zengzhao, et al.
Publicado: (2023)

Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
por: Zhou, Sizhong
Publicado: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
por: Krone, Maximilian
Publicado: (2025)

Cycle lengths in graphs of given minimum degree
por: Bai, Yandong, et al.
Publicado: (2025)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
por: Liu, Chun-Hung, et al.
Publicado: (2024)

Degree sequence condition for Hamiltonicity in tough graphs
por: Shan, Songling, et al.
Publicado: (2024)

The minimum size of a chordal graph with given order and minimum degree
por: Zhan, Xingzhi, et al.
Publicado: (2024)

Bipartite graphs with minimum degree at least 15 are antimagic
por: Deng, Kecai
Publicado: (2025)

Building graphs with high minimum degree on a budget
por: Katsamaktsis, Kyriakos, et al.
Publicado: (2024)

Compatible Hamilton cycles in graphs with large minimum degree
por: Behague, Natalie, et al.
Publicado: (2026)

Embedding trees using minimum and maximum degree conditions
por: Pokrovskiy, Alexey, et al.
Publicado: (2025)

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
por: Li, Chengli, et al.
Publicado: (2024)

The circumference of a graph with given minimum degree and clique number
por: Chen, Na, et al.
Publicado: (2025)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
por: Attwa, Yamaan, et al.
Publicado: (2025)

Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
por: Gan, Luyining, et al.
Publicado: (2026)

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors
por: Zhong, Jiaxu, et al.
Publicado: (2026)

Paired domination in graphs with minimum degree four
por: Bujtás, Csilla, et al.
Publicado: (2025)

Total coloring graphs with large minimum degree
por: Henderschedt, Owen, et al.
Publicado: (2025)

On the isolation number of graphs with minimum degree four
por: Goddard, Wayne, et al.
Publicado: (2025)

The spectral degree exponent of a graph
por: Achterberg, Massimo A., et al.
Publicado: (2025)

Constructions of minimally $t$-tough regular graphs
por: Cheng, Kun, et al.
Publicado: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
por: Wang, Xiaolin
Publicado: (2025)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
por: DeBiasio, Louis, et al.
Publicado: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
por: Lin, Hao, et al.
Publicado: (2024)

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
por: Chen, Yihan, et al.
Publicado: (2024)

Elimination distance to bounded degree on planar graphs
por: Lindermayr, Alexander, et al.
Publicado: (2020)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
por: Di Braccio, Francesco, et al.
Publicado: (2026)