Related papers: A Study on Clique Invariants of Jaco-type Graphs
FI-graphs were introduced by the second author and White to capture the idea of a family of nested graphs, each member of which is acted on by a progressively larger symmetric group. That work was built on the newly minted foundations of…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We survey recent results on graphs and their Laplacians related to the behavior of the graph at large. In particular, we focus on Liouville theorems, recurrence and characterizations of Dirichlet forms via boundary terms.
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
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 initiate a study of the vertex clique covering numbers of Johnson graphs $J(N, k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when $k \leq 3$, and…
This study investigates the properties of the 3-token graph derived from path graphs, with a particular focus on its structural characteristics and key attributes. We analyze how the 3-token graph is constructed from path graphs and explore…
We introduce a geometric invariant of knots in the three-sphere, called the first-order genus, that is derived from certain 2-complexes called gropes, and we show it is computable for many examples. While computing this invariant, we draw…
Data analysts commonly utilize statistics to summarize large datasets. While it is often sufficient to explore only the summary statistics of a dataset (e.g., min/mean/max), Anscombe's Quartet demonstrates how such statistics can be…
Combining geometric group theory techniques with geometric topology tools, we show how primitive cohomologies provide useful insights towards unifying the mathematical formulation of Gromov-Witten invariants. In particular, we emphasise the…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
We introduce the notion of clique number of a tournament and investigate its relation with the dichromatic number. In particular, it permits defining $\dic$-bounded classes of tournaments, which is the paper's main topic.
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…
This paper investigates prime and co-prime integer matrices and their properties. It characterizes all pairwise co-prime integer matrices that are also prime integer matrices. This provides a simple way to construct families of pairwise…
Cliques are defined as complete graphs or subgraphs; they are the strongest form of cohesive subgroup, and are of interest in both social science and engineering contexts. In this paper we show how to efficiently estimate the distribution…
The paper discusses quantum graphs with a vertex coupling which interpolates between the common one of the $\delta$ type and a coupling introduced recently by two of the authors which exhibits a preferred orientation. Describing the…