Related papers: Cliques in Representation Graphs of Quadratic Form…
The representation theory of semisimple algebraic groups over the complex numbers (equivalently, semisimple complex Lie algebras or Lie groups, or real compact Lie groups) and the question of whether a given representation is symplectic or…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We study graphon counterparts of the chromatic and the clique number, the fractional chromatic number, the b-chromatic number, and the fractional clique number. We establish some basic properties of the independence set polytope in the…
We show that the cliques of maximal size in the confluence graph of an arbitrary unital of order $q>2$ have size $q^2$, and that these cliques are the pencils of all blocks through a given point. This solves the Erd\H{o}s-Ko-Rado problem…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\'an's famous theorem. We consider the implications of the connectivity property of…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a…
We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width. This property is preserved by contractions of edges, one end of which is a vertex of degree 2.
A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and…
Let $G$ be a 2-connected $n$-vertex graph and $N_s(G)$ be the total number of $s$-cliques in $G$. Let $k\ge 4$ and $s\ge 2$ be integers. In this paper, we show that if $G$ has an edge $e$ which is not on any cycle of length at least $k$,…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
A graph $G$ of order $nv$ where $n\geq 2$ and $v\geq 2$ is said to be weakly $(n,v)$-clique-partitioned if its vertex set can be decomposed in a unique way into $n$ vertex-disjoint $v$-cliques. It is strongly $(n,v)$-clique-partitioned if…
We study maximal cliques in the collinearity graphs of Desarguesian nets, give some structural results and some numerical information. In particular, we show for Desarguesian nets that the set consisting of a point $x$ together with all its…
How do vertices exert influence in graph data? We develop a framework for edge clustering, a new method for exploratory data analysis that reveals how both vertices and edges collaboratively accomplish directed influence in graphs,…
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…
In this paper, we study non-zero component graph $\Gamma(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ over a finite field $\mathbb{F}$. We show that the graph is Hamiltonian and not Eulerian. We also characterize the…
The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…