Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs

[1]Bermond J. C. , Delorme C. , and Farhi G., Large graphs with given degree and diameter II , J Combin. Theory, Series B 36 (1984) 32-48. 10.1109/TC.1984.1676504.BermondJ. C.DelormeC.FarhiG.Large graphs with given degree and diameter IIJ Combin. Theory, Series B36198432–4810.1109/TC.1984.167650410.1016/0095-8956(84)90012-1Search in Google Scholar

[2]BondyJ. A. and Murty U. S. R., Graph Theory with Applications , 5th printing, American Elsevier Publishing Co., Inc., 1976.BondyJ. A.MurtyU. S. R.Graph Theory with Applications , 5th printingAmerican Elsevier Publishing Co., Inc197610.1007/978-1-349-03521-2Search in Google Scholar

[3]Chartrand G. and Harary F., Planar permutation graphs , Ann Inst H Poincaré Sec B 3 (1967) 433-438. http://eudml.org/doc/76875ChartrandG.HararyF.Planar permutation graphsAnn Inst H Poincaré Sec B31967433–438http://eudml.org/doc/76875Search in Google Scholar

[4]D. Bauer and E. Schmeichel: On a theorem of Häggkvist and Nicoghossian, In Y. Alavi, F.R.K. Chung, R.L. Graham and D. S. Hsu, eds., Graph Theory, Combinatorics, Algorithms, and Applications-Proceedings 2^nd China-USA Graph Theory Conference, SIAM(1991)20-25.BauerD.SchmeichelE.On a theorem of Häggkvist and NicoghossianAlaviY.ChungF.R.K.GrahamR.L.S. HsuD.Graph Theory, Combinatorics, Algorithms, and Applications-Proceedings 2^nd China-USA Graph Theory ConferenceSIAM199120-25Search in Google Scholar

[5]B. Wei, A Generalization of a result of Bauer and Schmeichel, Graphs and Combin. 9 (1993) 383-389. 10.1007/BF02988325WeiB.A Generalization of a result of Bauer and SchmeichelGraphs and Combin91993383–38910.1007/BF0298832510.1007/BF02988325Search in Google Scholar

[6]D. Bauer, H.J. Broersma, and H.J. Veldman, On generalizing a theorem of Jung, Ars Combinatoria 40 (1995) 207-218.BauerD.BroersmaH.J.VeldmanH.J.On generalizing a theorem of JungArs Combinatoria401995207–218Search in Google Scholar

[7]S. Wang, C. Wang, J. Liu, On extremal multiplicative Zagreb indices of trees with given domination number, Applied Mathematics and Computation, 332 (2018) 338-350. 10.1016/j.amc.2018.03.058.WangS.WangC.LiuJ.On extremal multiplicative Zagreb indices of trees with given domination numberApplied Mathematics and Computation3322018338–35010.1016/j.amc.2018.03.05810.1016/j.amc.2018.03.058Search in Google Scholar

[8]Z. Shao, J. Xu, S. Sheikholeslami, S.Wang, The domination complexity and related extremal values of large 3-D torus, Complexity, Volume 2018, Article ID 3041426, 8 pages. 10.1155/2018/3041426.ShaoZ.XuJ.SheikholeslamiS.S.Wang, The domination complexity and related extremal values of large 3-D torusComplexityVolume2018Article ID 30414268pages. 10.1155/2018/304142610.1155/2018/3041426Search in Google Scholar

[9]S. Wang, B. Wei, A note on the independent domination number versus the domina- tion number in bipartite graphs, Czechoslovak Mathematical Journal, 67 (142) (2017), 533-536. 10.21136/CMJ.2017.0068-16.WangS.WeiB. A note on the independent domination number versus the domina- tion number in bipartite graphsCzechoslovak Mathematical Journal671422017533–53610.21136/CMJ.2017.0068-1610.21136/CMJ.2017.0068-16Search in Google Scholar

[10]S. Ji, S. Wang, On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices, Journal of Mathematical Analysis and Applications, 458 (1) 2018, 21-29. 10.1016/j.jmaa.2017.09.005.JiS.WangS.On the sharp lower bounds of Zagreb indices of graphs with given number of cut verticesJournal of Mathematical Analysis and Applications4581201821–2910.1016/j.jmaa.2017.09.00510.1016/j.jmaa.2017.09.005Search in Google Scholar

[11]Y. Ahmad, U. Ali, M. bilal, S. Zafar, Z. Zahid, Some new standard graphs labeled by 3-total edge product cordial labeling 2 (2017)(1) 61-72. 10.21042/AMNS.2017.1.00005.AhmadY.AliU.bilalM.ZafarS.ZahidZ.Some new standard graphs labeled by 3-total edge product cordial labeling22017(1) 61-72. 10.21042/AMNS.2017.1.0000510.21042/AMNS.2017.1.00005Search in Google Scholar

[12]S. Sudhakar, S. Francis, V. Balaji, Odd mean labeling for two star graph, (2) 2017 (1) 195-200, 10.21042/AMNS.2017.1.00016.SudhakarS.FrancisS.BalajiV.Odd mean labeling for two star graph22017(1) 195-200, 10.21042/AMNS.2017.1.0001610.21042/AMNS.2017.1.00016Search in Google Scholar

[13]B. Basavanagoud, V.R. Desai, S. Patil, b,α-Connectivity Index of Graphs (2) 2017 (1) 21-30, 10.21042/AMNS.2017.1.00003.BasavanagoudB.DesaiV.R.PatilS.b,α-Connectivity Index of Graphs22017121–3010.21042/AMNS.2017.1.0000310.21042/AMNS.2017.1.00003Search in Google Scholar

[14]S. Zhou, L. Xu, Y. Xu, A sufficient condition for the existence of a k-factor excluding a given r-factor (2) 2017 (1) 13-20, 10.21042/AMNS.2017.1.00002.ZhouS.XuL.XuY.A sufficient condition for the existence of a k-factor excluding a given r-factor (2)2017113–2010.21042/AMNS.2017.1.0000210.21042/AMNS.2017.1.00002Search in Google Scholar