Related papers: A homogeneous polynomial associated with general h…
In this paper, we give a reduced formula of the characteristic polynomial of $k$-uniform hypergraphs with a pendant edge. And the explicit characteristic polynomial and all distinct eigenvalues of $k$-uniform hyperpath are given.
Every homogeneous Riemannian C_0-space (N,g) is associated with its minimal polynomial. To provide explicit examples, we compute the minimal polynomials for generalized Heisenberg groups equipped with their canonical left-invariant metrics.
In this paper, we study cliques and chromatic number of inhomogenous random graphs where the individual edge probabilities could be arbitrarily low. We use a recursive method to obtain estimates on the maximum clique size under a mild…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
The independence polynomial of a hypergraph is the generating function for its independent (vertex) sets with respect to their cardinality. This article aims to discuss several recurrence relations for the independence polynomial using some…
In this paper, we associate a growth graph and a length operator to a quotient space of a semisimple compact Lie group. Under certain assumptions, we show that the spectral dimension of a homogeneous space is greater than or equal to…
In this note we obtain an explicit formula for the Hosoya polynomial of any distance-regular graph in terms of its intersection array. As a consequence, we obtain a very simple formula for the Hosoya polynomial of any strongly regular…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. We provide a polynomial algorithm to produce an optimal bandwidth labeling for graphs in a special…
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…
The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\ge 2$, among connected $k$-uniform hypergraphs with $m\ge 1$ edges, we show that the $k$-uniform loose path…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…
The Harary-Sachs theorem for $k$-uniform hypergraphs equates the codegree-$d$ coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with $d$…
For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and $\mathcal{A}(G)$ are the diagonal tensor of…
We prove that the joint spectral radius and generalized spectral radius are equal for any bounded, equicontinuous family of order-preserving, homogeneous maps on a polyhedral cone. We also consider conditions which guarantee that the…
In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must occur when the spectral radius ratio is large. We also give…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…