Connectivity and planarity of g-noncommuting graph of finite groups
| Autor: | Ahmad Erfanian, Abbas Mohammadian, Mahboube Nasiri |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Symmetric graph
0102 computer and information sciences 01 natural sciences Combinatorics Graph power Computer Science::General Literature Graph toughness 0101 mathematics ComputingMilieux_MISCELLANEOUS Complement graph Mathematics Discrete mathematics Strongly regular graph Algebra and Number Theory Computer Science::Information Retrieval Applied Mathematics 010102 general mathematics Astrophysics::Instrumentation and Methods for Astrophysics Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Vertex-transitive graph TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Edge-transitive graph 010201 computation theory & mathematics ComputingMethodologies_DOCUMENTANDTEXTPROCESSING Bound graph MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Journal of Algebra and Its Applications. 17:1850107 |
| ISSN: | 1793-6829 0219-4988 |
| DOI: | 10.1142/s0219498818501074 |
| Popis: | Let [Formula: see text] be a finite non-abelian group and [Formula: see text] be its center. For a fixed nonidentity element [Formula: see text] of [Formula: see text], the [Formula: see text]-noncommuting graph of [Formula: see text], denoted by [Formula: see text], is a simple undirected graph in which its vertices are [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text] and [Formula: see text]. In this paper, we discuss about connectivity of [Formula: see text] and determine all finite non-abelian groups such that their [Formula: see text]-noncommuting graphs are 1-planar, toroidal or projective. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|