AbstractThe tensor product H⊗G where G is a 2k-regular graph can be regarded as a covering space of the permutation voltage graph H(2k) obtained from H. Assuming that H is suitably imbedded in some orientable surface by modifying the edges of H according to the configuration of G we get the permutation voltage graph H(2k) whose permutation derived graph is exactly H⊗G. This construction can also be extended to the tensor product H⊗G where G is a (2k + 1)-regular graph with 1-factor. Here we put the sufficient conditions on H and G so that the permutation derived imbedding obtained in this way is a minimal imbedding. We also give sample results — the genus of the tensor products H⊗K2n,2n and H⊗Qn are calculated for certain graphs H
AbstractIn this paper, tensor product of two regular complete multipartite graphs is shown to be Ham...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractIn this paper we present genus result for the tensor product of graphs where the second fact...
AbstractThis paper introduces the permutation voltage graph construction, which is a generalization ...
AbstractThis paper addresses the question of determining, for a given graphG, all regular maps havin...
AbstractUsing Petersen's theorem, that every regular graph of even degree is 2-factorable, it is pro...
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties ...
The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are...
It has been known that any covering space of a suitable topological space can be covered by a regula...
AbstractVoltage graphs, one of the main tools for constructing graph embeddings, appear to be useful...
AbstractIn the usual treatment of covering spaces, the algebraic object associated with a cover is a...
AbstractIn the paper is developed a common generalization of two methods of construction of regular ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
summary:In the category of symmetric graphs there are exactly five closed tensor products. If we omi...
AbstractIn this paper, tensor product of two regular complete multipartite graphs is shown to be Ham...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractIn this paper we present genus result for the tensor product of graphs where the second fact...
AbstractThis paper introduces the permutation voltage graph construction, which is a generalization ...
AbstractThis paper addresses the question of determining, for a given graphG, all regular maps havin...
AbstractUsing Petersen's theorem, that every regular graph of even degree is 2-factorable, it is pro...
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties ...
The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are...
It has been known that any covering space of a suitable topological space can be covered by a regula...
AbstractVoltage graphs, one of the main tools for constructing graph embeddings, appear to be useful...
AbstractIn the usual treatment of covering spaces, the algebraic object associated with a cover is a...
AbstractIn the paper is developed a common generalization of two methods of construction of regular ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
summary:In the category of symmetric graphs there are exactly five closed tensor products. If we omi...
AbstractIn this paper, tensor product of two regular complete multipartite graphs is shown to be Ham...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...