Zobrazeno 1 - 10
of 248
pro vyhledávání: '"eulerian graph"'
Autor:
Nilesh Khandekar, Vinayak Joshi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 3, Pp 238-248 (2024)
In this paper, we determine when the zero-divisor graph of a special class of a finite pseudocomplemented poset is Eulerian. Also, we deal with Hamiltonian, vertex pancyclic, and edge pancyclic properties of the complement of a zero-divisor graph of
Externí odkaz:
https://doaj.org/article/fdb819c35dbb4b1898aa19d7f2717380
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 161-166 (2024)
Let G be a finite group, let Irr(G) be the set of all complex irreducible characters of G and let cd(G) be the set of all degrees of characters in [Formula: see text] Let [Formula: see text] be the set of all primes that divide some degrees in [Formu
Externí odkaz:
https://doaj.org/article/e849e1c791744287aa0cdd34a107d032
Publikováno v:
Mathematics Interdisciplinary Research, Vol 8, Iss 3, Pp 279-290 (2023)
Let $R$ be a commutative ring with nonzero identity. Throughout this paper we explore some properties of two certain subgraphs of the maximal graph of $R$.
Externí odkaz:
https://doaj.org/article/19811a570f6c42afb9062d8b48c752c1
Publikováno v:
Ratio Mathematica, Vol 51, Iss 0 (2024)
Let \( R \) be a finite commutative ring with unity. We have introduced a divisor graph of the ring, denoted by \( D[R] \). It is an undirected simple graph with a vertex set \( V = R - \{0, 1\} \), and two distinct vertices \( u \) and \( v \) in \(
Externí odkaz:
https://doaj.org/article/12d1d0bcb1bf4fcd912d9b20d53b3bab
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Ratio Mathematica, Vol 41, Iss 0, Pp 207-213 (2021)
The near common neighborhood graph of a graph G, denoted by ncn(G) is defined as the graph on the same vertices of G, two vertices are adjacent in ncn(G), if there is at least one vertex in G not adjacent to both the vertices. In this research paper,
Externí odkaz:
https://doaj.org/article/e502379897824d70afb2083a6ebe4d40
Publikováno v:
Discussiones Mathematicae - General Algebra and Applications, Vol 41, Iss 2, Pp 419-437 (2021)
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G
Externí odkaz:
https://doaj.org/article/b396c81cef934dfc843623479dfbb5e4