Related papers: Cliques and the Spectral Radius
We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the connected graphs in a self-similar sequence have not only the…
In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
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 spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs…
The first study related to this paper was on the notion of primitive holes. This paper reports on research in respect of clique parameters and related properties thereof within Jaco-type graphs.
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…
Research on the relationship of the (signless Laplacian) spectral radius of a graph with its structure properties is an important research project in spectral graph theory. Denote by $\rho(G)$ and $q(G)$ the spectral radius and the signless…
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and…
We relate the notions of spectral gap for unitary representations and subfactors with definability of certain important sets in the corresponding structures. We give several applications of this relationship.
A multicomplex, also known as a twisted chain complex, has an associated spectral sequence via a filtration of its total complex. We give explicit formulas for all the differentials in this spectral sequence.
A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given $n$ points $x_1,…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is…
The cosmic ray energy distributions contain spectral features, that is narrow energy regions where the slope of the spectrum changes rapidly. The identification and study of these features is of great importance to understand the…
Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$ vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta \leq 4n/5$ and some other cases. Moreover, we give a construction, which we conjecture…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…