In spectral bisection, a Fielder vector is used for partitioning a graph into two connected subgraphs according to its sign pattern. In this article, we investigate graphs having Fiedler vectors with unbalanced sign patterns such that a partition can result in two connected subgraphs that are distinctly different in size. We present a characterization of graphs having a Fiedler vector with exactly one negative component, and discuss some classes of such graphs. We also establish an analogous result for regular graphs with a Fiedler vector with exactly two negative components. In particular, we examine the circumstances under which any Fiedler vector has unbalanced sign pattern according to the number of vertices with minimum degree.
Spectral Turán problem for $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs
School of Mathematics and Statistics,Northwestern Polytechnical University(西北工业大学数学与统计学院);Xi’an-Budapest Joint Research Center for Combinatorics,Northwestern Polytechnical University(西北工业大学西安-布达佩斯组合学联合研究中心)
Turán-type extremal problems for unbalanced signed graphs
Northwestern Polytechnical University(西北工业大学);Xi’an-Budapest Joint Research Center for Combinatorics, Northwestern Polytechnical University(西安-布达佩斯组合学联合研究中心);School of Mathematical Sciences & Academy for Multidisciplinary Studies, Captial Normal University(首都师范大学数学科学学院与跨学科研究院)