Square graphs of finite groups
Autor: | V. V. Swathi, M. S. Sunitha |
---|---|
Rok vydání: | 2021 |
Předmět: |
0209 industrial biotechnology
Finite group Cyclic group 02 engineering and technology Upper and lower bounds Graph Square (algebra) Vertex (geometry) Combinatorics Set (abstract data type) 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Undirected graph Mathematics |
Zdroj: | INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCES-MODELLING, COMPUTING AND SOFT COMPUTING (CSMCS 2020). |
ISSN: | 0094-243X |
DOI: | 10.1063/5.0045744 |
Popis: | An undirected graph called Square graph Γ(G) of a finite group G is introduced and defined as an undirected simple graph whose vertex set is G and two distinct vertices a and b are adjacent if and only if a2 = b or b2 = a. In this paper, for a finite group G, the number of edges of Γ(G) is computed. An upper bound to the clique number of Γ(G) and upper bound to the maximum degree of square graphs of finite cyclic groups are obtained. |
Databáze: | OpenAIRE |
Externí odkaz: |