Self-complementary vertex-transitive undirected graphs
Bohdan Zelinka (1979)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Bohdan Zelinka (1979)
Mathematica Slovaca
Similarity:
Walter Carlip, Martina Mincheva (2008)
Czechoslovak Mathematical Journal
Similarity:
We examine iteration graphs of the squaring function on the rings when , for a Fermat prime. We describe several invariants associated to these graphs and use them to prove that the graphs are not symmetric when and when and are symmetric when .
T. Pezda (2004)
Open Mathematics
Similarity:
We find all possible cycle-lengths for polynomial mappings in two variables over rings of integers in quadratic extensions of rationals.
Michel Mollard (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let (−→ Cm2−→ Cn) be the domination number of the Cartesian product of directed cycles −→ Cm and −→ Cn for m, n ≥ 2. Shaheen [13] and Liu et al. ([11], [12]) determined the value of (−→ Cm2−→ Cn) when m ≤ 6 and [12] when both m and n ≡ 0(mod 3). In this article we give, in general, the value of (−→ Cm2−→ Cn) when m ≡ 2(mod 3) and improve the known lower bounds for most of the remaining cases. We also disprove the conjectured formula for the case m ≡ 0(mod 3) appearing in [12]. ...
Cosgrave, John B., Dilcher, Karl (2008)
Integers
Similarity:
A. Rotkiewicz (1983)
Acta Arithmetica
Similarity:
Dilcher, Karl, Skula, Ladislav (2006)
Integers
Similarity:
Gica, Alexandru, Panaitopol, Laurenţiu (2003)
Journal of Integer Sequences [electronic only]
Similarity: