Paley-type graphs of order a product of two distinct primes
In this paper, we initiate the study of Paley-type graphs ГN modulo N = pq, where p, q are distinct primes of the form 4k + 1. It is shown that ГN is an edge-regular, symmetric, Eulerian and Hamiltonian graph. Also, the vertex connectivity, edge connectivity, diameter and girth of ГN are studied and...
Збережено в:
Дата: | 2019 |
---|---|
Автор: | |
Формат: | Стаття |
Мова: | English |
Опубліковано: |
Інститут прикладної математики і механіки НАН України
2019
|
Назва видання: | Algebra and Discrete Mathematics |
Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/188476 |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
Цитувати: | Paley-type graphs of order a product of two distinct primes / A. Das // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 1. — С. 44–59. — Бібліогр.: 17 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of UkraineРезюме: | In this paper, we initiate the study of Paley-type graphs ГN modulo N = pq, where p, q are distinct primes of the form 4k + 1. It is shown that ГN is an edge-regular, symmetric, Eulerian and Hamiltonian graph. Also, the vertex connectivity, edge connectivity, diameter and girth of ГN are studied and their relationship with the forms of p and q are discussed. Moreover, we specify the forms of primes for which ГN is triangulated or trianglefree and provide some bounds (exact values in some particular cases) for the order of the automorphism group Aut(ГN) of the graph ГN, the chromatic number, the independence number, and the domination number of ГN. |
---|