Xiaocong He

Xiaocong He

Auto-generated profile, based on publicly available information

Xiaocong He

Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2022 in Discrete Mathematics
Verified
Journal Article
Closed access
XHXiaocong He
Xiaocong He
LLLu Lu
Lu Lu

5 June 2020 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
Shahid ZamanShahid Zaman
Shahid Zaman
XHXiaocong He
Xiaocong He
A T -gain graph is a triple Φ = ( G , T , ϕ ) consisting of an underlying graph G = ( V ( G ) , E ( G ) ) , the circle group T = { z ∈ C : | z | = 1 } and a gain function ϕ : E → → T , such that ϕ ( e i j ) = ϕ ( e j i ) − 1 = ϕ ( e j i ) ¯ . In this paper, we focus our attention on the relations between the inertia indices of T -gain graph Φ and the inertia indices of its underlying graph G. We obtain sharp lower and upper bounds on p ( Φ ) (resp., n ( Φ ) ) in terms of p ( G ) (resp., n ( G ) ) and characterize those corresponding extremal T -gain graphs, respectively. As a corollary, we also characterize those signed graphs whose inertia indices obtaining the sharp bounds, respectively.

11 September 2024 in Discrete Mathematics
Verified
Journal Article
Closed access
XHXiaocong He
Xiaocong He
YLYongtao Li
Yongtao Li
Lihua FengLihua Feng
Lihua Feng

8 September 2022 in Discrete Mathematics
Verified
Journal Article
Closed access
XYXinru Yan
Xinru Yan
XHXiaocong He
Xiaocong He
Lihua FengLihua Feng
Lihua Feng
WLWeijun Liu
Weijun Liu

12 July 2024 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
XHXiaocong He
Xiaocong He
YLYongtao Li
Yongtao Li
Lihua FengLihua Feng
Lihua Feng
Let $F_s$ be the friendship graph obtained from $s$ triangles by sharing a common vertex. For every $s\ge 2$ and $n\ge 50s^2$, the Turán number of $F_s$ was investigated by Erdős, Füredi, Gould and Gunderson (1995). For sufficiently large $n$, the $F_s$-free graphs of order $n$ which attain the maximum spectral radius were firstly characterized by Cioabă, Feng, Tait and Zhang (2020), and later uniquely determined by Zhai, Liu and Xue (2022). Recently, the spectral extremal problems were studied for graphs that do not contain a certain graph $H$ as a minor. For instance, Tait (2019), Zhai and Lin (2022), Chen, Liu and Zhang (2024) solved the case of cliques, bicliques, cliques with some paths removed, respectively. Motivated by these results, we consider the spectral extremal problem for friendship graphs. Let $K_s\vee I_{n-s}$ be the complete split graph, which is the join of a clique of size $s$ with an independent set of size $n-s$. For sufficiently large $n$, we prove that $K_s \vee I_{n-s}$ is the unique graph that attains the maximal spectral radius over all $n$-vertex $F_s$-minor-free graphs.

24 February 2023 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Open access
PDF file
XHXiaocong He
Xiaocong He
Lihua FengLihua Feng
Lihua Feng
DSDragan Stevanović
Dragan Stevanović
The $(k+1)$-core of a graph $G$, denoted by $C_{k+1}(G)$, is the subgraph obtained by repeatedly removing any vertex of degree less than or equal to $k$. $C_{k+1}(G)$ is the unique induced subgraph of minimum degree larger than $k$ with a maximum number of vertices. For $1\leq k\leq m\leq n$, we denote $R_{n, k, m}=K_k\vee(K_{m-k}\cup {I_{n-m}})$. In this paper, we prove that $R_{n, k, m}$ obtains the maximum spectral radius and signless Laplacian spectral radius among all $n$-vertex graphs whose $(k+1)$-core has at most $m$ vertices. Our result extends a recent theorem proved by Nikiforov [Electron. J. Linear Algebra, 27:250--257, 2014]. Moreover, we also present the bipartite version of our result.