Skip to main content
Log in

Some Results on Tensor Product of a Graph and an Odd Cycle

  • Short Communication
  • Published:
National Academy Science Letters Aims and scope Submit manuscript

Abstract

The tensor product \(G \times H\) of two graphs G and H is a graph such that the vertex set of \(G \times H\) is the cartesian product \(V(G) \times V(H)\) and two vertices \((u_1, u_2)\) and \((v_1, v_2)\) are adjacent in \(G \times H\) if and only if \(u_1\) is adjacent to \(v_1\) in G and \(u_2\) is adjacent to \(v_2\) in H. In this paper, we establish a structural characterization of \(G \times C_{2n+1}\). Further, we discuss Eulerian, Hamiltonian and planar properties of \(G \times C_{2n+1}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

References

  1. Sabidussi G (1960) Graph multiplication. Math Z 72:446–457

    Article  MathSciNet  MATH  Google Scholar 

  2. Vizing VG (1963) The cartesian product of graphs. Vyc Sis 9:30–43

    MathSciNet  Google Scholar 

  3. Imrich W, Klavžar S (2000) Product graphs: structure and recognition. Wiley, New York

    MATH  Google Scholar 

  4. Ĉulík K (1958) Zur theorie der graphen. Ĉasopis pro Pêstování Matematiky 83(2):133–155

    MathSciNet  MATH  Google Scholar 

  5. Weichsel PM (1962) The kronecker product of graphs. Proc Am Math Soc 13:47–52

    Article  MathSciNet  MATH  Google Scholar 

  6. Bosak J (1991) Decompositions of graphs. Kluwer Academic Publication, Dordrecht

    MATH  Google Scholar 

  7. Miller DJ (1968) The categorical product of graphs. Can J Math 20:1511–1521

    Article  MathSciNet  MATH  Google Scholar 

  8. Bermond JC (1978) Hamiltonian decompositions of graphs, digraphs, hypergraphs. Ann Discrete Math 3:21–28

    Article  MathSciNet  MATH  Google Scholar 

  9. Capobianco MF (1970) On characterizing tensor-composite graphs. Ann N Y Acad Sci 175:80–84

    Article  ADS  MathSciNet  MATH  Google Scholar 

  10. Harary F, Wilcox G (1967) Boolean operations on graphs. Math Scand 20:41–51

    Article  MathSciNet  MATH  Google Scholar 

  11. Asmerom GA (1998) Imbeddings of the tensor product of graphs where the second factor is a complete graph. Discrete Math 182:13–19

    Article  MathSciNet  MATH  Google Scholar 

  12. Bottreau A, Métivier Y (1998) Some remarks on the Kronecker product of graphs. Inf Proc Lett 68(2):55–61

    Article  MathSciNet  MATH  Google Scholar 

  13. Farzan M, Waller DA (1977) Kronecker products and local joins of graphs. Can J Math 29:255–269

    Article  MathSciNet  MATH  Google Scholar 

  14. Harary F, Trauth CA Jr (1966) Connectedness of products of two directed graphs. SIAM J Appl Math 14(2):250–254

    Article  MathSciNet  MATH  Google Scholar 

  15. Acharya BD (1975) Contributions to the theories of hyper grapahs, graphoids and graphs, Ph.D. Thesis, Indian Institute of Technology, Bombay

  16. Sampathkumar E (1975) On tensor product graphs. J Aust Math Soc 20(A):268–273

    Article  MathSciNet  MATH  Google Scholar 

  17. Harary F (1969) Graph theory. Addison-Wesley Publishing Company, Reading

    Book  MATH  Google Scholar 

  18. West DB (1996) Introduction to graph theory. Prentice-Hall of India Pvt. Ltd, Delhi

    MATH  Google Scholar 

  19. Gravier S (1997) Hamiltonicity of the cross product of two Hamiltonian graphs. Discrete Math 170:253–257

    Article  MathSciNet  MATH  Google Scholar 

  20. Dirac GA (1952) Some theorems on abstract graphs. Proc Lond Math Soc 2(3):69–81

    Article  MathSciNet  MATH  Google Scholar 

  21. Acharya M, Sinha D (2006) Common-edge sigraphs. AKCE Int J Graphs Comb 3(2):115–130

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors express their gratitude to Prof. E. Sampathkumar who in his early research has brought up the idea of tensor product of the particular graphs which on reading gave us an instant insight to go for \(G \times C_{2n+1}\) and admire the beauty of traversability and many interesting properties of the structure.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deepa Sinha.

Additional information

Research is supported by the Department of Science and Technology (Govt. of India), New Delhi, India under the Project SR/S4/MS: 409/06.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sinha, D., Garg, P. Some Results on Tensor Product of a Graph and an Odd Cycle. Natl. Acad. Sci. Lett. 41, 243–247 (2018). https://doi.org/10.1007/s40009-018-0642-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40009-018-0642-1

Keywords

Mathematics Subject Classification

Navigation