Heights in finite projective space, and a problem on directed graphs.
Nathanson, Melvyn B., Sullivan, Blair D. (2008)
Integers
Similarity:
Displaying similar documents to “On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths”
Heights in finite projective space, and a problem on directed graphs.
Cycles of polynomial mappings in two variables over rings of integers in quadratic fields
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.
Self-complementary vertex-transitive undirected graphs
Bohdan Zelinka (1979)
Mathematica Slovaca
Similarity:
Conjugate cyclic -configurations
Věroslav Jurák (1980)
Časopis pro pěstování matematiky
Similarity:
Restricted walks in regular trees.
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Intrinsically linked graphs and even linking number.
Fleming, Thomas, Diesl, Alexander (2005)
Algebraic & Geometric Topology
Similarity:
Two Graphs with a Common Edge
Lidia Badura (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = G1 ∪ G2 be the sum of two simple graphs G1,G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant det A(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope and effectiveness of our method we give some examples