|
 |
| Bimonthly Since 1986 |
ISSN 1004-9037
|
|
 |
|
|
| Publication Details |
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
|
|
|
|
| |
|
|
|
|
|
|
|
Abstract
Let G be a non-abelian group and Ω ⊂ G. The Non-Commuting graph Γ = (G, Ω), has Ω as its vertex set with two distinct elements of Ω joined by an edge when they do not commute in G. In this article, we investigate among some properties of Non-Commuting graphs and the degree of all vertices in Γ. We also study a necessary and sufficient condition for Γ to be Eulerian.
Keyword
Non-commuting graph, dihedral group, toroidal
PDF Download (click here)
|
|
|
|
|
