Autor:	Chakrabarty, Ivy, Kureethara, Joseph Varghese, Acharya, Mukti
Předmět:	NATURAL numbers UNDIRECTED graphs EULERIAN graphs EULER'S numbers MATHEMATICAL connectedness DOMINATING set FINITE The COMPLETE graphs
Zdroj:	South East Asian Journal of Mathematics & Mathematical Sciences; 2022, Vol. 18 Issue 3, p433-448, 16p
Abstrakt:	Let Gn = (V, E) be an undirected simple graph, whose vertex set comprises of the natural numbers which are less than n but not relatively prime to n and two distinct vertices u, v ∈ V are adjacent if and only if gcd(u, v) > 1. Connectedness, completeness, minimum degree, maximum degree, independence number, domination number and Eulerian property of the graph Gn are studied in this paper. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu