Related papers: Power Graph Classes and Overfullness
A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a \emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…
We study the finite solvable groups $G$ in which every real element has prime power order. We divide our examination into two parts: the case $\textbf{O}_2(G)>1$ and the case $\textbf{O}_2(G)=1$. Specifically we proved that if…
An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a…
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers $k$ and $\ell$ such that the $k$-th powers of the graphs are of clique-width at most $\ell$. We give sufficient and…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group $(\Delta(G)+1)$-edge-choosable while…
Let $G$ be a group. An automorphism of $G$ is called intense if it sends each subgroup of $G$ to a conjugate; the collection of such automorphisms is denoted by $\mathrm{Int}(G)$. In the special case in which $p$ is a prime number and $G$…
The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…
A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if…
In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…
In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup…
We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…
The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors…
The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we…
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a…
An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we…