Extremal Results for \(K^-_{r+1}\) -free Unbalanced Signed Graphs

This paper investigates the Turan-like problem for \(\mathcal{K}^-_{r + 1}\)-free \((r \geq 2)\) unbalanced signed graphs, where \(\mathcal{K}^-_{r + 1}\) is the set of unbalanced signed complete graphs with \(r+1\) vertices. The maximum number of edges and the maximum index for \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs are given. Moreover, the extremal \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs with the maximum index are characterized.

Authors

Institutions

Publication Details

Journal
Ars Combinatoria
Published
2024-12-31
DOI
https://doi.org/10.61091/ars161-05
Citations
3
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
3.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extremal Results for \(K^-_{r+1}\) -free Unbalanced Signed Graphs

Yaoping Hou, Zhuang Xiong
3 citations
Ars Combinatoria
Limits and Structures in Graph Theory
3.97
article

Extremal Results for \(K^-_{r+1}\) -free Unbalanced Signed Graphs

Yaoping Hou, Zhuang Xiong
article en
3 citations

Abstract

This paper investigates the Turan-like problem for \(\mathcal{K}^-_{r + 1}\)-free \((r \geq 2)\) unbalanced signed graphs, where \(\mathcal{K}^-_{r + 1}\) is the set of unbalanced signed complete graphs with \(r+1\) vertices. The maximum number of edges and the maximum index for \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs are given. Moreover, the extremal \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs with the maximum index are characterized.

Ars CombinatoriaVol. 161(1)
Hunan Normal University (CN)
Openalex Percentile: Top 5%
Limits and Structures in Graph Theory
3.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.