Advanced search
Publication Cover
International Journal of Computer Mathematics: Computer Systems Theory Volume 7, 2022 - Issue 1
Submit an article Journal homepage
262
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Super connectivity of a family of direct product graphs

F. Soliemanya Department of Mathematics, Urmia University, Urmia, Iran
,
M. Ghasemia Department of Mathematics, Urmia University, Urmia, IranCorrespondence[email protected]
&
R. Varmazyarb Department of Mathematics, Khoy Branch, Islamic Azad University, Khoy, Iran
Pages 1-5 | Received 21 Jan 2020, Accepted 16 Aug 2021, Published online: 12 Sep 2021

References

  • F.T. Boesch, Synthesis of reliable networks-A survey, IEEE Trans. Reliab. 35 (1986), pp. 240–246.
  • F. Boesch and D. Bauer, Connectivity extremal problems and the design of reliable probabilistic networks, in The Theory and Application of Graphs, Y. Alavi, G. Chartand, eds., Wiley, New York, 1981, pp. 89–98.
  • F.T. Boesch and R. Tindell, Circulants and their connectivities, J. Graph Theory 8(4) (1984), pp. 487–499.
  • J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Elsevier, New York, 1967.
  • A. Bottreau and Y. Metivier, Some remarks on the Kronecker product of graphs, Inform. Process. Lett. 68 (1998), pp. 55–61.
  • B. Brešar, W. Imrich, S. Klavzar and B. Zmazek, Hypercubes as direct products, SIAM J. Discrete Math. 18 (2005), pp. 778–786.
  • G.B. Ekinci and A. Kirlangiç, Super connectivity of kronecker product of complete bipartite graphs and complete graphs, Discrete Math. 339 (2016), pp. 1950–1953.
  • S. Ghozati, A finite automata approach to modeling the cross product of interconnection networks, Math. Compute. Model. 30(7) (1999), pp. 185–200.
  • R. Guji and E. Vumar, A note on the connectivity of Kronecker products of graphs, Appl. Math. Lett. 22(9) (2009), pp. 1360–1363.
  • L. Guo, C. Chen and X. Guo, Super connectivity of Kronecker products of graphs, Inform. Process. Lett. 110 (2010), pp. 659–661.
  • L.T. Guo and X.F. Guo, Super connectivity of Kronecker products of some graphs, Ars Combin. 123 (2015), pp. 65–73.
  • L.T. Guo, C.G. Qin and X.F. Guo, Super connectivity of kronecker products of graphs, Inform. Process. Lett. 110(16) (2010), pp. 659–661.
  • L.T. Guo, W. Yang and X. Guo, Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs, Appl. Math. Lett. 26(1) (2013), pp. 120–123.
  • Kh. Kamyab, M. Ghasemi and R. Varmazyar, Super connectivity of lexicographic product graphs, (accepted to Ars Combinatoria) arXiv:2009.04831[math.GR].
  • R. Lammprey and B. Barnes, Products of graphs and applications, Model Simul. 5 (1974), pp. 1119–1123.
  • M. Lu, C. Wu and G.L. Chen, Super connectivity of cartesian product graphs, Networks. 52(2) (2008), pp. 78–87.
  • E. Lubetzky and N. Alon, Independent sets in tensor powers, J. Graph Theory 54 (2007), pp. 73–87.
  • M. Ma, G. Liu and J.M. Xu, The super connectivity of augmented cubes, Inform. Process. Lett. 106(2) (2008), pp. 59–63.
  • D.J. Miller, The categorical product of graphs, Canad. J. Math. 20(6) (1968), pp. 1511–1521.
  • H.C. Wang, E.F. Shan and W. Wang, On the super connectivity of Kronecker products of graphs, Inform. Process. Lett. 12 (2012), pp. 402–405.
  • W. Wang and Z.D. Yan, Connectivity of Kronecker products with complete multipartite graphs, Discrete Appl. Math. 161 (2013), pp. 1655–1659.
  • P.M. Weichsel, The Kronecker product of graphs, Proc. Amer. Math. Soc. 13(1) (1962), pp. 47–52.
  • C. Yang and J.M. Xu, Connectivity of lexicographic product and direct product of graphs, Ars Combin. 111 (2013), pp. 3–12.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.