This paper considers commuting graphs over the semidihedral group SD8n . We compute their eigenvalues and obtain that these commuting graphs are not hyperenergetic for odd n ≥ 15 or even n ≥ 2. We further compute the Laplacian spectrum, the Laplacian energy and the number of spanning trees of the commuting graphs over SD8n . We also discuss vertex connectivity, planarity, and minimum disconnecting sets of these graphs and prove that these commuting graphs are not Hamiltonian.Peer reviewe
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular...
summary:The eigenvalues of graphs are related to many of its combinatorial properties. In his fundam...
This paper considers commuting graphs over the semidihedral group SD8n . We compute their eigenvalue...
Study about spectra of graph has became interesting work as well as study about commuting and non co...
For a finite group G and a nonempty subset X of G, we construct a graph with a set of vertex X such ...
The commuting graph of a finite non-abelian group G with center Z(G), denoted by Γc(G), is a simple ...
the energy of a graph is the sum of the absolute value of the eigenvalues of the adjacency matrix of...
Let G be a graph with vertex set V = {v1,v2,..., vp}, A(G) is adjacency matrix of G and D(G) is diag...
This thesis concentrates on an investigation to describe the properties of groups in graph-theoreti...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
A commuting graph is a graph denoted by C(G,X) where G is any group and X, a subset of a group G, is...
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as th...
Using the standard Coxeter presentation for the symmetric group Sn, two re- duced expressions for t...
The θ-commutators of elements of a group with respect to an automorphism are introduced and their pr...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular...
summary:The eigenvalues of graphs are related to many of its combinatorial properties. In his fundam...
This paper considers commuting graphs over the semidihedral group SD8n . We compute their eigenvalue...
Study about spectra of graph has became interesting work as well as study about commuting and non co...
For a finite group G and a nonempty subset X of G, we construct a graph with a set of vertex X such ...
The commuting graph of a finite non-abelian group G with center Z(G), denoted by Γc(G), is a simple ...
the energy of a graph is the sum of the absolute value of the eigenvalues of the adjacency matrix of...
Let G be a graph with vertex set V = {v1,v2,..., vp}, A(G) is adjacency matrix of G and D(G) is diag...
This thesis concentrates on an investigation to describe the properties of groups in graph-theoreti...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
A commuting graph is a graph denoted by C(G,X) where G is any group and X, a subset of a group G, is...
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as th...
Using the standard Coxeter presentation for the symmetric group Sn, two re- duced expressions for t...
The θ-commutators of elements of a group with respect to an automorphism are introduced and their pr...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular...
summary:The eigenvalues of graphs are related to many of its combinatorial properties. In his fundam...