Related papers: Graph complements of circular graphs

Let $G$ be a simple graph of order $n$. The double vertex graph $F_2(G)$ of $G$ is the graph whose vertices are the $2$-subsets of $V(G)$, where two vertices are adjacent in $F_2(G)$ if their symmetric difference is a pair of adjacent…

Energy of a simple graph $G$, denoted by $\mathcal{E}(G)$, is the sum of the absolute values of the eigenvalues of $G$. Two graphs with the same order and energy are called equienergetic graphs. A graph $G$ with the property $G\cong…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are…

For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we…

The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple…

To estimate the lower bound for the chromatic number of a graph $G$, Lov\'asz associated a simplicial complex $\mathcal{N}(G)$ called the neighborhood complex and relates the topological connectivity of $\mathcal{N}(G)$ to the chromatic…

The triangle graph of a graph $G$, denoted by ${\cal T}(G)$, is the graph whose vertices represent the triangles ($K_3$ subgraphs) of $G$, and two vertices of ${\cal T}(G)$ are adjacent if and only if the corresponding triangles share an…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i \varphi_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations…

Let $\varepsilon(G)$ be the eccentricity matrix of a graph $G$ and $Spec(\varepsilon(G))$ be the eccentricity spectrum of $G$. Let $H[G_1,G_2,\ldots, G_k]$ be the $H$-join of graphs $G_1,G_2,\ldots, G_k$ and let $H[G]$ be lexicographic…

We write the Euler characteristic X(G) of a four dimensional finite simple geometric graph G=(V,E) in terms of the Euler characteristic X(G(w)) of two-dimensional geometric subgraphs G(w). The Euler curvature K(x) of a four dimensional…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

Let $T_G(x,y)$ be the Tutte polynomial of a graph $G$. In this paper we show that if $(G_n)_n$ is a sequence of $d$-regular graphs with girth $g(G_n)\to \infty$, then for $x\geq 1$ and $0\leq y\leq 1$ we have $$\lim_{n\to…

The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. It is a known result…

This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological…