Related papers: A Study on Clique Invariants of Jaco-type Graphs
In this paper we introduce the quadratic Jaco graph. The characteristics, properties and some graph invariants of quadratic Jaco graphs are discussed. The observation that quadratic Jaco graphs are well-defined in respect of complete graphs…
We study cliques in graphs arising from quadratic forms where the vertices are the elements of the module of the quadratic form and two vertices are adjacent if their difference represents some fixed scalar. We determine structural…
Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of $J_n(m, m-1)$ Johnson graphs. Cliques and maximal cliques are characterized and…
In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…
We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.
A hole of a simple connected graph $G$ is a chordless cycle $C_n,$ where $n \in \Bbb N, n \geq 4,$ in the graph $G$. The girth of a simple connected graph $G$ is the smallest cycle in $G$, if any such cycle exists. It can be observed that…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
A \emph{primitive hole} of a graph $G$ is a cycle of length 3 in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of the graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the…
We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…
This document begins by reviewing recent progress that has been made by taking a combinatorial perspective on the $c_2$ invariant, an arithmetic graph invariant with connections to Feynman integrals. Then it proceeds to report on some…
Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
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…
We present a number of relations involving the number of cliques in a graph and its spectral radius.
In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…