Related papers: The eigenvalues of $q$-Kneser graphs
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…
In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…
The eigenvector-eigenvalue identities are expanded to include general mixing parameters. Some simple relations are obtained and they reveal an intricate texture of connections between the eigenvalues and the mixing parameters. Permutation…
We obtain connection coefficients between $q$-binomial and $q$-trinomial coefficients. Using these, one can transform $q$-binomial identities into a $q$-trinomial identities and back again. To demonstrate the usefulness of this procedure we…
We give combinatorial proofs of $q$-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz's identity, a new proof of the $q$-Frobenius identity of Garsia and Remmel and of Ehrenborg's Hankel…
In this paper, we derive basic identities of symmetry in two variables related to higher-order q-Euler polynomials and q-analogue of higher order alternating power sums. The derivation of identities are based on the multibvariate p-adic…
We find closed form formulas for Kemeny's constant and its relationship with two Kirchhoffian indices for some composite graphs that use as basic building block a graph endowed with one of several symmetry properties.
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
Suppose we want to find the eigenvalues and eigenvectors for the linear operator L, and suppose that we have solved this problem for some other "nearby" operator K. In this paper we show how to represent the eigenvalues and eigenvectors of…
Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…
Recently, Kim-Jang-Yi have introduced q-Bernstein polynomials. From these q-Berstein polynomials, we investigte some properties related to q-Stirling numbes and q-Bernoulli numbes.
Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…
We describe some basic tools in the spectral theory of Schr\"odinger operator on metric graphs (also known as "quantum graph") by studying in detail some basic examples. The exposition is kept as elementary and accessible as possible. In…
In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…
The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to…
Given a simple graph $G$, its $A_\alpha$ matrix is a convex combination with parameter $\alpha\in [0,1]$ of its adjacency matrix and its degree diagonal matrices. Here we compare two lower bounds presented in [J. D. G. Silva Jr., C. S.…
We determine the chromatic number of the Kneser graph q{\Gamma}_{7,{3,4}} of flags of vectorial type {3, 4} of a rank 7 vector space over the finite field GF(q) for large q and describe the colorings that attain the bound. This result…