Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.09870

Signed spectral Turań type theorems

M. Rajesh Kannan·Shivaramakrishna Pragada
View original source ↗Read source document ↗Export metadata ↓

Abstract

A signed graph $Σ= (G, σ)$ is a graph where the function $σ$ assigns either $1$ or $-1$ to each edge of the simple graph $G$. The adjacency matrix of $Σ$, denoted by $A(Σ)$, is defined canonically. In a recent paper, Wang et al. extended the eigenvalue bounds of Hoffman and Cvetković for the signed graphs. They proposed an open problem related to the balanced clique number and the largest eigenvalue of a signed graph. We solve a strengthened version of this open problem. As a byproduct, we give alternate proofs for some of the known classical bounds for the least eigenvalues of the unsigned graphs. We extend the Turán's inequality for the signed graphs. Besides, we study the Bollobás and Nikiforov conjecture for the signed graphs and show that the conjecture need not be true for the signed graphs. Nevertheless, the conjecture holds for signed graphs under some assumptions. Finally, we study some of the relationships between the number of signed walks and the largest eigenvalue of a signed graph.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Rajesh Kannan, Shivaramakrishna Pragada. 2023-01-05. Signed spectral Turań type theorems. https://arxiv.org/abs/2204.09870

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗