Saved in:
| Main Authors: | Guan, Rui, Jiang, Chenglin, Lai, Hong-Jian, Li, Jiaao, Li, Xinyuan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.18100 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Realizing Degree Sequences With S3‐Connected Graphs
by: Rui Guan, et al.
Published: (2026)
by: Rui Guan, et al.
Published: (2026)
Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order
by: Li, Jiaao, et al.
Published: (2026)
by: Li, Jiaao, et al.
Published: (2026)
Frustration indices of signed subcubic graphs
by: Chen, Sirui, et al.
Published: (2025)
by: Chen, Sirui, et al.
Published: (2025)
The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)
by: Bell, Sasha, et al.
Published: (2026)
The index of $t\mathcal{C}_{3}^{-}$-free signed graphs
by: Li, Dan, et al.
Published: (2025)
by: Li, Dan, et al.
Published: (2025)
Which $L$-cospectral graphs have same degree sequences
by: Ye, Jiachang
Published: (2024)
by: Ye, Jiachang
Published: (2024)
A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2025)
by: Shan, Songling, et al.
Published: (2025)
Spectral Turán problem for $\mathcal{K}_{3,3}^{-}$-free signed graphs
by: Qin, Mingsong, et al.
Published: (2025)
by: Qin, Mingsong, et al.
Published: (2025)
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)
by: Zhang, Leilei
Published: (2024)
Quasimonophobic graphs and degree spectral sequences in discrete cubical homology
by: Jamil, Samira Sahar, et al.
Published: (2026)
by: Jamil, Samira Sahar, et al.
Published: (2026)
Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
On $\mathcal{F}$-multicolor Turán number of hypergraph graphs
by: Li, Ping
Published: (2025)
by: Li, Ping
Published: (2025)
On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
by: Wu, Tingzeng, et al.
Published: (2025)
by: Wu, Tingzeng, et al.
Published: (2025)
Hook immanantal equalities for linear combination matrices of (di)graphs and their applications
by: Dong, Xiangshuai, et al.
Published: (2025)
by: Dong, Xiangshuai, et al.
Published: (2025)
Fractional balanced chromatic number of signed subcubic graphs
by: Hu, Xiaolan, et al.
Published: (2025)
by: Hu, Xiaolan, et al.
Published: (2025)
Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)
by: Bai, Yandong, et al.
Published: (2025)
A unified approach to the spectral radius, connectivity and edge-connectivity of graphs
by: Wang, Yu, et al.
Published: (2024)
by: Wang, Yu, et al.
Published: (2024)
The number of dissociation sets in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)
by: Yuan, Bo-Jun, et al.
Published: (2024)
High-Dimensional $p$-Normed Flows
by: Li, Chenxing, et al.
Published: (2026)
by: Li, Chenxing, et al.
Published: (2026)
Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)
by: Xia, Zheng-Jiang, et al.
Published: (2026)
Triangle processes on graphs with given degree sequence
by: Cooper, Colin, et al.
Published: (2023)
by: Cooper, Colin, et al.
Published: (2023)
Ore's Theorem for rainbow Hamiltonian-connected graphs
by: Li, Yupei, et al.
Published: (2025)
by: Li, Yupei, et al.
Published: (2025)
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
by: Gao, Pu, et al.
Published: (2020)
by: Gao, Pu, et al.
Published: (2020)
Essential connectivity and spectral radius of graphs
by: Ding, Wenxiu, et al.
Published: (2024)
by: Ding, Wenxiu, et al.
Published: (2024)
Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026)
by: Cai, Yiting, et al.
Published: (2026)
Extremal distance spectra of graphs and essential connectivity
by: Zhang, Daoxia, et al.
Published: (2025)
by: Zhang, Daoxia, et al.
Published: (2025)
The $K_{1,2}$-structure-connectivity of graphs
by: Zhao, Xiao, et al.
Published: (2024)
by: Zhao, Xiao, et al.
Published: (2024)
On minimizing the Wiener index of unicyclic graphs with fixed girth and given degree sequence
by: Burger, Alewyn P., et al.
Published: (2024)
by: Burger, Alewyn P., et al.
Published: (2024)
Characterization of $P_3$-connected graphs
by: Chen, Rong
Published: (2025)
by: Chen, Rong
Published: (2025)
Super-minimally $3$-connected graphs
by: Ge, Wayne
Published: (2025)
by: Ge, Wayne
Published: (2025)
Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)
by: Huang, Ting, et al.
Published: (2025)
Spanning tree-connected subgraphs with small degrees
by: Hasanvand, Morteza
Published: (2022)
by: Hasanvand, Morteza
Published: (2022)
On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)
by: Bai, Yandong, et al.
Published: (2026)
3-path-connectivity of Cayley graphs generated by wheel graphs
by: Luo, Yi-Lu, et al.
Published: (2025)
by: Luo, Yi-Lu, et al.
Published: (2025)
Equating three degrees of graphs
by: Liu, Zhen, et al.
Published: (2025)
by: Liu, Zhen, et al.
Published: (2025)
Diameter two orientability of mixed graphs
by: Li, Hengzhe, et al.
Published: (2024)
by: Li, Hengzhe, et al.
Published: (2024)
Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)
by: Li, Peishan
Published: (2025)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
On the pancyclicity of $2$-connected $[5,3]$-graphs
by: Liu, Feng, et al.
Published: (2025)
by: Liu, Feng, et al.
Published: (2025)
Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
by: Kabela, Adam, et al.
Published: (2024)
by: Kabela, Adam, et al.
Published: (2024)
Similar Items
-
Realizing Degree Sequences With S3‐Connected Graphs
by: Rui Guan, et al.
Published: (2026) -
Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order
by: Li, Jiaao, et al.
Published: (2026) -
Frustration indices of signed subcubic graphs
by: Chen, Sirui, et al.
Published: (2025) -
The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026) -
The index of $t\mathcal{C}_{3}^{-}$-free signed graphs
by: Li, Dan, et al.
Published: (2025)