On the unitary Cayley graph of a finite ring.
Akhtar, Reza, Boggess, Megan, Jackson-Henderson, Tiffany, Jiménez, Isidora, Karpman, Rachel, Kinzel, Amanda, Pritikin, Dan (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Akhtar, Reza, Boggess, Megan, Jackson-Henderson, Tiffany, Jiménez, Isidora, Karpman, Rachel, Kinzel, Amanda, Pritikin, Dan (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
W. B. Vasantha Kandasamy (1990)
Extracta Mathematicae
Similarity:
Petrović, Zoran Z., Moconja, Slavko M. (2008)
Novi Sad Journal of Mathematics
Similarity:
Zoran Pucanović, Zoran Petrović (2011)
Publications de l'Institut Mathématique
Similarity:
Martin Sonntag, Hanns-Martin Teichert (2016)
Discussiones Mathematicae Graph Theory
Similarity:
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v} ⊆ V is an edge of CGl(D) if and only if there is a vertex w ∈ V such that (u, w), (v, w) ∈ A. In CGl(D), loops {v} are allowed only if v is the only predecessor of a certain vertex w ∈ V. For several products D1 ⚬ D2 of digraphs D1 and D2, we investigate the relations between the competition graphs of the factors D1, D2 and the competition graph of their product D1 ⚬ D2.
Bohdan Zelinka (1975)
Časopis pro pěstování matematiky
Similarity:
Courcelle, Bruno (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Charles Lanski, Attila Maróti (2009)
Open Mathematics
Similarity:
In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand isomorphic to the field with two elements. This result is used to describe those finite rings R for which Γ(R) contains a Hamiltonian cycle where Γ(R) is the (simple) graph defined on the elements of R with an edge between vertices r and s if and only if r - s is invertible. It is also shown that for an Artinian ring R the number of connected components of...
Bohdan Zelinka (1987)
Mathematica Slovaca
Similarity: