In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on the at torus. For any size collection of geodesics, the number of unique intersections is countable via their slopes. As well, any embedding of two geodesics gives rise to a circulant graph for which its chromatic number can be calculated from their respective slopes. Furthermore, the previously described circulant graphs embedded on the at torus are self-dual. This provides an effective face coloring of any graph arising from the embedding of two slopes on the torus
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
AbstractWe show how to construct all the graphs that can be embedded on both the torus and the Klein...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
The curve graph, g, associated to a compact surface Sigma is the 1-skeleton of the curve complex def...
We construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, with inte...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
AbstractWe show how to construct all the graphs that can be embedded on both the torus and the Klein...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
The curve graph, g, associated to a compact surface Sigma is the 1-skeleton of the curve complex def...
We construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, with inte...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every...