Xiaofeng Gu

William Zhang

Discret. Math. Algorithms Appl., February, 2024

Spectral characterization of the complete graph removing a cycle.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2024

2023

Spectral radius and edge-disjoint spanning trees.

[BibT_eX]

[DOI]

Dandan Fan

Huiqiu Lin

J. Graph Theory, December, 2023

Spanning tree packing and 2-essential edge-connectivity.

[BibT_eX]

[DOI]

Runrun Liu

Gexin Yu

Discret. Math., 2023

Graph Rigidity Properties of Ramanujan Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

On hamiltonian line graphs of hypergraphs.

[BibT_eX]

[DOI]

Sulin Song

J. Graph Theory, 2022

ℓ $\ell $ -Connectivity and ℓ $\ell $ -edge-connectivity of random graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

A tight lower bound on the matching number of graphs via Laplacian eigenvalues.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Spectral strengthening of a theorem on transversal critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Extremal augmented Zagreb index of trees with given numbers of vertices and leaves.

[BibT_eX]

[DOI]

Discret. Math., 2022

Cyclically Orderable Generalized Petersen Graphs.

[BibT_eX]

[DOI]

William Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021

Sufficient Conditions for 2-Dimensional Global Rigidity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

A Proof of Brouwer's Toughness Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Toughness in pseudo-random graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2021

Spectral conditions for graph rigidity in the Euclidean plane.

[BibT_eX]

[DOI]

Sebastian M. Cioaba

Sean Dewar

Discret. Math., 2021

2020

Spanning bipartite graphs with high degree sum in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Spectral characterization of the complete graph removing a path.

[BibT_eX]

[DOI]

Haiying Shan

Discret. Appl. Math., 2020

2018

Spectrum bounds for the scattering number, integrity, tenacity of regular graphs.

[BibT_eX]

[DOI]

Yinkui Li

Yongtang Shi

Future Gener. Comput. Syst., 2018

A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Cycles with a chord in dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2016

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Fractional spanning tree packing, forest covering and eigenvalues.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.

[BibT_eX]

[DOI]

Sebastian M. Cioaba

CoRR, 2016

2014

Characterizations of Strength Extremal Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

Improved algorithms for optimal length resolution refutation in difference constraint systems.

[BibT_eX]

[DOI]

K. Subramani

Matthew D. Williamson

Formal Aspects Comput., 2013

Realizing degree sequences with <i>k</i>-edge-connected uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

2012

Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees.

[BibT_eX]

[DOI]

Yanting Liang

Appl. Math. Lett., 2012

2011

Characterization of minimally (2, <i>l</i>)-connected graphs.

[BibT_eX]

[DOI]

Senmei Yao

Inf. Process. Lett., 2011

Absorbing random walks and the NAE2SAT problem.

[BibT_eX]

[DOI]

K. Subramani

Int. J. Comput. Math., 2011

2009

Random walks for selected boolean implication and equivalence problems.

[BibT_eX]

[DOI]

K. Subramani