On graphs with equal dominating and c-dominating energy

[1]C. Adiga, A. Bayad, I. Gutman and S. Srinivas, The minimum covering energy of a graph, Kragujevac Journal of Science 34 (2012), 39–56.AdigaC.BayadA.GutmanI.SrinivasS.The minimum covering energy of a graphKragujevac Journal of Science3420123956Search in Google Scholar

[2]S.Arumugam, J. Paulraj Joseph, On graphs with equal domination and connected domination numbers, Discrete Math. 206 (1999) 45-49.ArumugamS.Paulraj JosephJ.On graphs with equal domination and connected domination numbersDiscrete Math.20619994549Search in Google Scholar

[3]A. Aslam, S. Ahmad, M. A. Binyamin, W. Gao, Calculating topological indices of certain OTIS Interconnection networks, Open Chemistry, 2019, 17, 220-228.AslamA.AhmadS.BinyaminM. A.GaoW.Calculating topological indices of certain OTIS Interconnection networksOpen Chemistry201917220228Search in Google Scholar

[4]A. Balban, Chemical applications of graph theory, Academic Press (1976).BalbanA.Chemical applications of graph theoryAcademic Press1976Search in Google Scholar

[5]R. Bapat, Graphs and Matrices, Hindustan Book Agency (2011).BapatR.Graphs and MatricesHindustan Book Agency2011Search in Google Scholar

[6]M. Biernacki, H. Pidek and C. Ryll-Nardzewski, Sur une inégalité entre des intégrales déefinies, Univ. Marie Curie- Sktoodowska A4 (1950), 1–4.BiernackiM.PidekH.Ryll-NardzewskiC.Sur une inégalité entre des intégrales déefiniesUniv. Marie Curie- Sktoodowska A4195014Search in Google Scholar

[7]X. Chen, L. Sun and H. Xing, Characterization of graphs with equal domination and connected domination numbers, Discrete Math. 289(2004) 129–135.ChenX.SunL.XingH.Characterization of graphs with equal domination and connected domination numbersDiscrete Math.2892004129135Search in Google Scholar

[8]C. Coulson and G. Rushbrooke, Note on the method of molecular orbitals, Mathematical Proceedings of the Cambridge Philosophical Society 36 (1940), 193–200.CoulsonC.RushbrookeG.Note on the method of molecular orbitalsMathematical Proceedings of the Cambridge Philosophical Society361940193200Search in Google Scholar

[9]V. Consonni and R. Todeschini, New spectral index for molecule description, MATCH Communications in Mathematical and in Computer Chemistry 60 (2008), 3–14.ConsonniV.TodeschiniR.New spectral index for molecule descriptionMATCH Communications in Mathematical and in Computer Chemistry602008314Search in Google Scholar

[10]D. Cvetković, P. Rowlinson and S. Simiċ, Eigenspaces of Graphs, Cambridge University Press (1997).CvetkovićD.RowlinsonP.SimiċS.Eigenspaces of GraphsCambridge University Press1997Search in Google Scholar

[11]J. Diaz and F. Metcalf, Stronger forms of a class of inequalities of G. Pólya-G.Szegö and L. V. Kantorovich, Bulletin of the American Mathematical Society 69 (1963), 415–418.DiazJ.MetcalfF.Stronger forms of a class of inequalities of G. Pólya-G.Szegö and L. V. KantorovichBulletin of the American Mathematical Society691963415418Search in Google Scholar

[12]W. Gao, Z. Iqbal, M. Ishaq, A. Aslam, R. Sarfraz, Topological aspects of dendrimers via distance based descriptors, IEEE Access, 2019, 7(1), 35619-35630.GaoW.IqbalZ.IshaqM.AslamA.SarfrazR.Topological aspects of dendrimers via distance based descriptorsIEEE Access2019713561935630Search in Google Scholar

[13]I. Gutman, The energy of a graph, Ber. Math.-Statist. Sekt. Forschungszentrum Graz 103 (1978), 1–22.GutmanI.The energy of a graphBer. Math.-Statist. Sekt. Forschungszentrum Graz1031978122Search in Google Scholar

[14]I. Gutman and O. Polansky, Mathematical Concepts in Organic Chemistry, Springer–Verlag, Berlin, 1986.GutmanI.PolanskyO.Mathematical Concepts in Organic ChemistrySpringer–VerlagBerlin1986Search in Google Scholar

[15]I. Gutman and B. Zhou, Laplacian energy of a graph, Linear Algebra and its Applications 414 (2006), 29–37.GutmanI.ZhouB.Laplacian energy of a graphLinear Algebra and its Applications41420062937Search in Google Scholar

[16]F. Harary, Graph Theory, Addison–Wesely, Reading, 1969.HararyF.Graph TheoryAddison–WeselyReading1969Search in Google Scholar

[17]G. Indulal, I. Gutman and A. Vijayakumar, On distance energy of graphs, MATCH Communications in Mathematical and in Computer Chemistry 60 (2008), 461–472.IndulalG.GutmanI.VijayakumarA.On distance energy of graphsMATCH Communications in Mathematical and in Computer Chemistry602008461472Search in Google Scholar

[18]M. Jooyandeh, D. Kiani and M. Mirzakhah, Incidence energy of a graph, MATCH Communications in Mathematical and in Computer Chemistry 62 (2009), 561–572.JooyandehM.KianiD.MirzakhahM.Incidence energy of a graphMATCH Communications in Mathematical and in Computer Chemistry622009561572Search in Google Scholar

[19]J. Koolen and V. Moulton, Maximal energy graphs, Advances in Applied Mathematics 26 (2001), 47–52.KoolenJ.MoultonV.Maximal energy graphsAdvances in Applied Mathematics2620014752Search in Google Scholar

[20]J. Liu and B. Liu, A Laplacian-energy like invariant of a graph, MATCH Communications in Mathematical and in Computer Chemistry 59 (2008), 355–372.LiuJ.LiuB.A Laplacian-energy like invariant of a graphMATCH Communications in Mathematical and in Computer Chemistry592008355372Search in Google Scholar

[21]B. McClelland, Properties of the latent roots of a matrix: The estimation of π-electron energies, The Journal of Chemical Physics 54 (1971), 640–643.McClellandB.Properties of the latent roots of a matrix: The estimation of π-electron energiesThe Journal of Chemical Physics541971640643Search in Google Scholar

[22]I. Milovanovć, E. Milovanovć and A. Zakić, A short note on graph energy, MATCH Communications in Mathematical and in Computer Chemistry 72 (2014), 179–182.MilovanovćI.MilovanovćE.ZakićA.A short note on graph energyMATCH Communications in Mathematical and in Computer Chemistry722014179182Search in Google Scholar

[23]M. Naeem, M. K. Siddiqui, J. L. G. Guirao, W. Gao, New and modified eccentric indices of octagonal grid O^m_n, 2018, 3, 209-228.NaeemM.SiddiquiM. K.GuiraoJ. L. G.GaoW.New and modified eccentric indices of octagonal grid O^m_n20183209228Search in Google Scholar

[24]J. Rada, Energy ordering of catacondensed hexagonal systems, Discrete Applied Mathematics 145 (2005), 437–443.RadaJ.Energy ordering of catacondensed hexagonal systemsDiscrete Applied Mathematics1452005437443Search in Google Scholar

[25]M. Rajesh Kanna, B. Dharmendra and G. Sridhara, The minimum dominating energy of a graph, International Journal of Pure and Applied Mathematics 85 (2013), 707–718.Rajesh KannaM.DharmendraB.SridharaG.The minimum dominating energy of a graphInternational Journal of Pure and Applied Mathematics852013707718Search in Google Scholar

[26]H. Sachs, beziehungen zwischen den in einem graphen enthaltenen kreisen und seinem charakteristischen polynom, Ibid. 11 (1963), 119–134.SachsH.beziehungen zwischen den in einem graphen enthaltenen kreisen und seinem charakteristischen polynomIbid.111963119134Search in Google Scholar

[27]E. Sampathkumar and H.Walikar, The connected domination number of a graph, Journal of Mathematical and Physical Sciences 13 (1979), 607–613.SampathkumarE.WalikarH.The connected domination number of a graphJournal of Mathematical and Physical Sciences131979607613Search in Google Scholar

[28]I. Shparlinski, On the energy of some circulant graphs, Linear Algebra and its Applications 414 (2006), 378–382.ShparlinskiI.On the energy of some circulant graphsLinear Algebra and its Applications4142006378382Search in Google Scholar

[29]N. Trinajstić, Chemical graph theory, CRC Press (1992).TrinajstićN.Chemical graph theoryCRC Press1992Search in Google Scholar

[30]A. R. Virk, M, Quraish, Some invariants of flower graph, Appl. Math. Nonl. Sc., 2018, 3, 427-432VirkA. R.QuraishMSome invariants of flower graphAppl. Math. Nonl. Sc.20183427432Search in Google Scholar

[31]B. Zhou, Energy of a graph, MATCH Communications in Mathematical and in Computer Chemistry 51 (2004), 111– 118.ZhouB.Energy of a graphMATCH Communications in Mathematical and in Computer Chemistry512004111118Search in Google Scholar