In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on the flat torus. For any size collection of geodesics, the number of unique intersec-tions 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. Further-more, the previously described circulant graphs embedded on the flat torus are self-dual. This provides an effective face coloring of any graph arising from the embedding of two slopes on the torus. \u
AbstractA fiber in an infinite graph is an equivalence class of rays whereby two rays belong to the ...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
We construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, with inte...
AbstractWe show how to construct all the graphs that can be embedded on both the torus and the Klein...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
AbstractA fiber in an infinite graph is an equivalence class of rays whereby two rays belong to the ...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
We construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, with inte...
AbstractWe show how to construct all the graphs that can be embedded on both the torus and the Klein...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
AbstractA fiber in an infinite graph is an equivalence class of rays whereby two rays belong to the ...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
Add to ORKG