Degree and Distance in 2-cartesian Product of Graphs
Abstract
The cartesian product of two graphs is well-known graph product and studied in detail. This concept has been generalized by introducing 2-cartesian product of graphs. The connectedness of 2-cartesian product of graphs has been discussed earlier. In this paper, first we obtain degree formula and discuss regularity of this product of graphs. Also, we have discuss distance between two vertices in this product.
Cite this Article
H.S. Mehta and U.P. Acharya. Degree and Distance in 2-Cartesian Product of Graphs. Research & Reviews: Discrete Mathematical Structures. 2018; 5(3): 11–14p.
Keywords
Full Text:
PDFReferences
Acharya UP, Mehta HS. 2-Cartesian product of special graphs. Int. J. of Math and Soft Computing. 2014; 4(1): 139–144p.
Acharya UP, Mehta HS. Generalized Cartesian Product of Graphs. Int. J. of Math. and Scientific Comp. 2015; 5(1): 4–7p.
Acharya UP, Mehta HS. Connectedness and Distancein G ⨂2 H. IOSR Journal of Mathematics. 2017; Vol. 13(1) (IV), 1-7.
Balakrishnan R, Ranganathan K, A Textbook of Graph Theory, Universitext, NewYork: Springer; 2012.
Richard Hammack, Wilfried Imrich, Sandi Klavzar. Handbook of Product Graphs, Discrete Mathematics and its Applications. New York: CRC-Press; 2011.
Hanning MA, Swart HC. On nth Order Degree Regular Trees. Indian J. Pure. Appl. Math. 1995; 26(8): 777–786p.
Refbacks
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/