The non-inverse graph corresponding to a group G, is a simple graph with vertices being elements of the group G and there is an edge between two vertices if they are not mutual inverses. In the current paper, we study few properties of the non-inverse graphs of groups. We also discuss the parameters related different types of domination no.s of the non-inverse graph. We further obtain the Laplacian spectra and signless Laplacian spectra of the non-inverse graphs.

1.
M. R.
Alfuraidan
and
Y. F.
Zakariya
, “
Inverse graphs associated with finite groups
,”
Electron. J. Graph Theory Appl.
5
(
2017
).
2.
I.
Chakrabarty
,
S.
Ghosh
,
T. K.
Mukherjee
, and
M. K.
Sen
, “
Intersection graphs of ideals of rings
,”
Discrete math.
309
,
5381
5392
(
2009
).
3.
X. L.
Ma
,
H. Q.
Wei
, and
L. Y.
Yang
, “
The coprime graph of a group
,”
International Journal of Group Theory
3
,
13
23
(
2014
).
4.
X. L.
Ma
,
H. Q.
Wei
, and
G.
Zhong
, “
The cyclic graph of a finite group
,”
Algebra
2013
(
2013
).
5.
D. F.
Anderson
and
P. S.
Livingston
, “
The zero-divisor graph of a commutative ring
,”
J. Algebra
217
,
434
447
(
1999
).
6.
J.
Amreen
and
S.
Naduvath
, “
On non-inverse graph of a group
,”
Discuss. Math. Gen. Algebra Appl. to appear
(
2021
).
7.
D. B.
West
,
Introduction to graph theory
(
Pearson
,
New Jersey
,
2001
).
8.
P. M.
Cohn
,
Basic algebra
(
Springer
,
2003
).
9.
T. W.
Haynes
,
S.
Hedetniemi
, and
P.
Slater
,
Fundamentals of domination in graphs
(
CRC press
,
1998
).
10.
T. W.
Haynes
,
S. T.
Hedetniemi
, and
M. A.
Henning
,
Topics in Domination in Graphs
(
Springer
,
2020
).
11.
S.
Balamurugan
,
M.
Anitha
, and
S.
Kalaiselvi
, “
Chromatic connected domination in graphs
,”
Journal of Discrete Mathematical Sciences and Cryptography
22
,
753
760
(
2019
).
12.
G. S.
Domke
,
J. H.
Hattingh
,
S. T.
Hedetniemi
,
R. C.
Laskar
, and
L. R.
Markus
, “
Restrained domination in graphs
,”
Discrete Mathematics
203
,
61
69
(
1999
).
13.
T.
Janakiraman
,
S.
Muthammai
, and
M.
Bhanumathi
, “
Global domination and neighborhood numbers ináboolean function graph of a graph
,”
Mathematica Bohemica
130
,
231
246
(
2005
).
14.
D.
Rautenbach
, “
Bounds on the strong domination number
,”
Discrete Mathematics
215
,
201
212
(
2000
).
15.
M.
Livingston
and
Q. F.
Stout
, “
Perfect dominating sets
,” in
Congressus Numerantium
79
,
187
203
(
1990
).
16.
P. B.
Sarasija
and
P.
Nageswari
, “
Laplacian energy of certain graphs
,”
International Journal of Mathematical Combinatorics
1
,
78
(
2012
).
17.
W.
Wang
and
D.
Yang
, “
Bounds for incidence energy of some graphs
,”
Journal of Applied Mathematics
2013
(
2013
).
This content is only available via PDF.
You do not currently have access to this content.