相关论文: The smallest eigenvalue of K_p-free graphs

As a nonlinear extension of the graph Laplacian, the graph $p$-Laplacian has various applications in many fields. Due to the nonlinearity, it is very difficult to compute the eigenvalues and eigenfunctions of graph $p$-Laplacian. In this…

Let $A(G)$ and $D(G)$ be the adjacency and degree matrices of a simple graph $G$ on $n$ vertices, respectively. The \emph{$A_\alpha$-spectral radius} of $G$ is the largest eigenvalue of $A_\alpha (G)=\alpha D(G)+(1-\alpha)A(G)$ for a real…

Let $G$ be a triangle-free graph on $n$ vertices with adjacency matrix eigenvalues $\mu_1(G)\geq \mu_2(G)\geq \dots \geq \mu_n(G)$. In this paper we study the quantity $$\mu_1(G)+\mu_n(G).$$ We prove that for any triangle-free graph $G$ we…

Let $G = (V, E)$ be a graph. We define matrices $M(G; \alpha, \beta)$as $\alpha D + \beta A$, where $\alpha$, $\beta$ are real numbers such that $(\alpha, \beta) \neq (0, 0)$ and $D$ and $A$ are the diagonal matrix and adjacency matrix of…

Let $X$ be $k$-regular graph on $v$ vertices and let $\tau$ denote the least eigenvalue of its adjacency matrix $A(X)$. If $\alpha(X)$ denotes the maximum size of an independent set in $X$, we have the following well known bound: \[…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…

Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. The adjacency matrix of $\Gamma=(G, \sigma)$ is a square matrix $A(\Gamma)=A(G, \sigma)=\left(a_{i j}^{\sigma}\right)$, where $a_{i…

Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $\pm 1$? In this paper, we answer this question for the adjacency, Laplacian and signless Laplacian matrix of a…

For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Oliveira, Lima, Rama and Carvalho conjectured that $K^+_{1,n-1}$ (the star graph with an additional edge) is…

The $Q$-index of graph $G$ is the largest eigenvalue of the signless Laplacian matrix of $G$. Wang [Discrete Appl. Math. 356(2024)] proved the sharp upper bounds on the $Q$-index of leaf-free graphs with given size and characterized the…

In this work we present a survey of results on the problem of finding the minimum cardinality of the support of eigenfunctions of graphs.

Let $A_n$ be the anti-regular graph of order $n.$ It was conjectured that among all threshold graphs on $n$ vertices, $A_n$ has the smallest positive eigenvalue and the largest eigenvalue less than $-1.$ Recently, in \cite{Cesar2} was given…

In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all graphs of Colin de Verdi\`ere parameter at most $m$. We also characterize graphs of maximum spectral radius with no $H$ as a minor…

We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.

In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $\pm 1$. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this…