Heights in finite projective space, and a problem on directed graphs.
Nathanson, Melvyn B., Sullivan, Blair D. (2008)
Integers
Similarity:
Nathanson, Melvyn B., Sullivan, Blair D. (2008)
Integers
Similarity:
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.
Bohdan Zelinka (1979)
Mathematica Slovaca
Similarity:
Věroslav Jurák (1980)
Časopis pro pěstování matematiky
Similarity:
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fleming, Thomas, Diesl, Alexander (2005)
Algebraic & Geometric Topology
Similarity:
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
Tengxia Ju, Meiyun Wu (2014)
Czechoslovak Mathematical Journal
Similarity:
In the first part, we assign to each positive integer a digraph whose set of vertices consists of elements of the ring with the addition and the multiplication operations modulo and for which there is a directed edge from to if and only if . Associated with are two disjoint subdigraphs: and whose union is The vertices of are coprime to and the vertices of are not coprime to In this part, we study the structure of in detail. In the second part, we investigate...
Yair Caro, Michael S. Jacobson (2003)
Discussiones Mathematicae Graph Theory
Similarity:
For a graph G, a positive integer k, k ≥ 2, and a non-negative integer with z < k and z ≠ 1, a subset D of the vertex set V(G) is said to be a non-z (mod k) dominating set if D is a dominating set and for all x ∈ V(G), |N[x]∩D| ≢ z (mod k).For the case k = 2 and z = 0, it has been shown that these sets exist for all graphs. The problem for k ≥ 3 is unknown (the existence for even values of k and z = 0 follows from the k = 2 case.) It is the purpose of this paper to show that for k...