September 3, 2024Open Access

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph

Key Points

Key points are not available for this paper at this time.

Abstract

Let = (Kₙ, H) be a signed complete graph whose negative edges induce a subgraph H. Let A () be the adjacency matrix of the signed graph. The largest eigenvalue of A () is called the index of. In this paper, the index of all the signed complete graphs whose negative edges induce a bicyclic graph B is investigated. Specifically, the structure of the bicyclic graph B such that = (Kₙ, B) has the maximum index is determined.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

Fang et al. (Tue,) studied this question.

synapsesocial.com/papers/68e598edb6db64358753410c https://doi.org/https://doi.org/10.48550/arxiv.2409.01923

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The index of unbalanced signed complete graphs whose negative-edge-induced subgraph is <i>K</i> <sub>2,2</sub> -minor free2026
2Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices2024
3On the eigenvalues of complete bipartite signed graphs2024 · 3 citations
4Maximizing the Index of Signed Complete Graphs Containing a Spanning Tree with k Pendant Vertices2024 · 1 citations
5Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below2025 · 1 citations

Bookmark

View Full Paper