arXiv subjects
Publications and source records attributed to Jin Cai.
It is proved that for a graph of order $n$, where $n\ge 6$, if the signless Laplacian index is larger than or equal to certain value depending on $n$, then the graph contains a trebly chorded cycle, where the chords incident to a common vertex, unless it is one of two specified graphs.
Outerplanar Tur\'an problem has received considerable attention recently. We study the spectral version via $Q$-index. We determine the unique graph that maximizes the $Q$-index among all $n$-vertex connected outerplanar graphs which are respectively forbidden to contain: (i) a fixed cycle; and (ii) the disjoint union of paths of a given order.
In this paper, we show that for a graph of order $n$, where $n\ge 5$, if the signless Laplacian index is larger than or equal to certain value depending on $n$, then the graph contains a doubly chorded cycle, where the chords incident to a common vertex, unless it is two specified graphs.
Let $G$ be a nontrivial graph with minimum degree $δ$ and $k$ an integer with $k\ge 2$. In the literature, there are eigenvalue conditions that imply $G$ contains $k$ edge-disjoint spanning trees. We give eigenvalue conditions that imply $G$ contains $k$ edge-disjoint spanning trees and another forest $F$ with $|E(F)|>\frac{δ-1}δ(|V(G)|-1)$, and if $F$ is not a spanning tree, then $F$ has a component with at least $δ$ edges.
A chorded cycle is a cycle with at least one chord. Gould asked in [Graphs Comb. 38 (2022) 189] the question: What spectral conditions imply a graph contains a chorded cycle? For a graph with fixed size, extremal spectral conditions are given to ensure that a graph contains a chorded cycle and a $(2k-3)$-chorded $(2k+1)$-cycle for $k\ge 2$, respectively, via spectral radius.
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.
A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$-factor-critical in terms of spectral radius and signless Laplacian spectral radius.
Exotic links and chains attract interests across various disciplines including mathematics, biology, chemistry and physics. Here, we propose that topological Hopf-chain networks, consisting of one-, two- and three-dimensional (3D) Hopf chains, can be found in the momentum space. These networks can be evolved from a 3D triple-points phase by varying symmetries of a four-band model. Moreover, we identify that the Hopf-chain networks exist in a family of crystals Sc3XC (X = Al, Ga, In, Tl). The crystals are 3D triple-points metals, and transit to topological metals with Hopf-chain networks under strains. These novel Hopf networks exhibit unique Landau levels and magneto-transport properties.
Coexistence of topological elements in a topological metal/semimetal (TM) has gradually attracted attentions. However, the non-topological factors always mess up the Fermi surface and cover interesting topological properties. Here, we find that Ba3Si4 is a "clean" TM in which coexists nodal-chain network, intersecting nodal rings (INRs) and triple points, in the absence of spin-orbit coupling (SOC). Moreover, the nodal rings in the topological phase exhibit diverse types: from type-I, type-II to type-III rings according to band dispersions. All the topological elements are generated by crossings of three energy bands, and thus they are correlated rather than mutual independence. When some structural symmetries are eliminated by an external strain, the topological phase evolves into another phase including Hopf link, one-dimensional nodal chain and new INRs.