A graph G has a representation modulo n if there exists an injective map f : V (G) → {0, 1, . . . , n} such that vertices u and v are adjacent if and only if |f(u) − f(v)| is relatively prime to n. The representation number rep(G) is the smallest n such that G has a representation modulo n. We present new results involving representation numbers for stars, split graphs, complements of split graphs, and hypercube
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...
In part I of the present paper the following problem was investigated. Let G be a finite simple grap...
A graph G has a representation modulo n if there exists an injective map f: V (G) → {0, 1,..., n} su...
AbstractA graph G has a representation modulo r if there exists an injective map f:V(G)→{0,1,…,r−1} ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph has a representation modulo n if there exists an injective map f: {V (G)} → {0, 1,...,n − 1}...
AbstractIn this paper we will present some new bounds on representation numbers and dimensions of di...
We extend the concept of graph representations modulo integers introduced by Erdös and Evans to grap...
AbstractWe study the representation number for some special sparse graphs. For graphs with a single ...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
We introduce star number (tree number) of a graph G, which is the minimum t such that G is the inter...
Abstract. Let S be a finite non-empty set of primes, ZS the ring of those rationals whose denominato...
A graph is representable by a ring if its vertices can be labeled with distinct ring elements so the...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...
In part I of the present paper the following problem was investigated. Let G be a finite simple grap...
A graph G has a representation modulo n if there exists an injective map f: V (G) → {0, 1,..., n} su...
AbstractA graph G has a representation modulo r if there exists an injective map f:V(G)→{0,1,…,r−1} ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph has a representation modulo n if there exists an injective map f: {V (G)} → {0, 1,...,n − 1}...
AbstractIn this paper we will present some new bounds on representation numbers and dimensions of di...
We extend the concept of graph representations modulo integers introduced by Erdös and Evans to grap...
AbstractWe study the representation number for some special sparse graphs. For graphs with a single ...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
We introduce star number (tree number) of a graph G, which is the minimum t such that G is the inter...
Abstract. Let S be a finite non-empty set of primes, ZS the ring of those rationals whose denominato...
A graph is representable by a ring if its vertices can be labeled with distinct ring elements so the...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...
In part I of the present paper the following problem was investigated. Let G be a finite simple grap...