8 papers
Frustration index of a signed planar graph and the feedback vertex set
Sirui Chen, Jiaao Li, Zhouningxin Wang
A feedback vertex set of a graph is a set of vertices whose deletion leaves a forest. In 2016, Dross, Montassier, and Pinlou conjectured that every planar graph of girth at lea…
Reconfiguration of Nowhere-zero Flows
Daniel W. Cranston, Jiaao Li, Bo Su +2
Fix an abelian group , a graph , and nowhere-zero -flows and on . Now and are \emph{-flow-adjacent} if there exists a cycle in such tha…
Positive and negative 3-energies of graphs
Zhengbo Chen, Zhouningxin Wang, Xiao-Dong Zhang
For a simple graph with vertices, let denote the adjacency matrix of , and let be its eigenvalues. For an integer $p…
Orientations of -Edge-Connected Planar Multigraphs and Applications
Daniel W. Cranston, Jiaao Li, Bo Su +2
A graph is called strongly -connected if for each boundary function with , there exists an orientatio…
Characterization of strongly -connected graphs of small order
Jiaao Li, Bo Su, Zhouningxin Wang +1
A graph is strongly -connected if for each boundary function with for every vertex and $\sum_{v \in V(G)} β…
Frustration indices of signed subcubic graphs
Sirui Chen, Jiaao Li, Zhouningxin Wang
The frustration index of a signed graph is defined as the minimum number of negative edges among all switching-equivalent signatures. This can be regarded as a generalization of th…