Turán problem for K4−-free signed graphs

Fan Chen and Xiying Yuan

Applied Mathematics and Computation, 2024, vol. 477, issue C

Abstract: Let G˙ be an unbalanced signed graph. In this paper, we establish that e(G˙)⩽12(n2−n)−(n−3) and ρ(G˙)⩽n−2 if G˙ does not contain unbalanced K4 as a signed subgraph. Moreover, comprehensive characterizations of the extremal signed graphs have been obtained.

Keywords: Signed graph; Turán problem; Adjacency matrix; Spectral radius (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324002753
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:477:y:2024:i:c:s0096300324002753

DOI: 10.1016/j.amc.2024.128814

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().