Results 11 to 20 of about 2,362 (196)

COMMON NEIGHBOURHOOD SPECTRUM AND ENERGY OF COMMUTING CONJUGACY CLASS GRAPH [PDF]

open access: yesJournal of Algebraic Systems, 2023
In this paper, we compute the common neighbourhood (abbreviated as CN) spectrum and the common neighbourhood energy of commuting conjugacy class graph of several families of finite non-abelian groups.
Firdous Jannat, Rajat Nath
doaj   +1 more source

Commuting graph of CA−groups

open access: yesProyecciones (Antofagasta), 2023
A group G is called a CA−group, if all the element centralizers of G are abelian and the commuting graph of G with respect to a subset A of G, denoted by Γ(G, A), is a simple undirected graph with vertex set A and two distinct vertices a and b are adjacent if and only if ab = ba.
Torktaz, Mehdi, Ashrafi, Ali Reza
openaire   +1 more source

A graph associated to a commutative semiring

open access: yesCommunications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2021
Summary: Let \(R\) be a commutative finite semiring with nonzero identity and \(H\) be an arbitrary multiplicatively closed subset \(R\). The generalized identity-summand graph of \(R\) is the (simple) graph \(G_H (R)\) with all elements of \(R\) as the vertices, and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(x + y \in H\).
ATANİ, Shahabaddin Ebrahimi   +3 more
openaire   +4 more sources

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2017
Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet.
Abdussakir Abdussakir   +2 more
doaj   +1 more source

On diameters estimations of the commuting graphs of Sylow $p$-subgroups of the symmetric groups

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2013
The commuting graph of a group $G$ is an undirected graph whose vertices are non-central elements of $G$ and two distinct vertices $x,y$ are adjacent if and only if $xy=yx$.
Yu.Yu. Leshchenko, L.V. Zoria
doaj   +3 more sources

Mostar index of graphs associated to groups

open access: yesMain Group Metal Chemistry, 2022
A bond-additive connectivity index, named as the Mostar index, is used to measure the amount of peripheral edges of a simple connected graph, where a peripheral edge in a graph is an edge whose one end vertex has more number of vertices closer as ...
Rehman Masood Ur   +4 more
doaj   +1 more source

Commuting projections on graphs

open access: yesNumerical Linear Algebra with Applications, 2013
SUMMARYMotivated by the increasing importance of large‐scale networks typically modeled by graphs, this paper is concerned with the development of mathematical tools for solving problems associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators.
Panayot S. Vassilevski   +1 more
openaire   +3 more sources

GENUS OF COMMUTING GRAPHS OF CERTAIN FINITE GROUPS [PDF]

open access: yesJournal of Algebraic Systems
The commuting graph of a finite group G is a graph whose vertex set is the set of non-central elements of G and two distinct vertices are adjacent if they commute.
Parhajit Bhowal, Rajat Nath
doaj   +1 more source

Certain Topological Indices of Non-Commuting Graphs for Finite Non-Abelian Groups

open access: yesMolecules, 2022
A topological index is a number derived from a molecular structure (i.e., a graph) that represents the fundamental structural characteristics of a suggested molecule.
Fawad Ali   +5 more
doaj   +1 more source

Commuting graphs and extremal centralizers

open access: yesArs Mathematica Contemporanea, 2013
We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n  ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy