S. Akbari, Hamideh Alizadeh, M. Fakharan, M. Habibi, Samane Rabizadeh, Soheyr Rouhani
{"title":"Some Relations Between Rank, Vertex Cover Number and Energy of Graph","authors":"S. Akbari, Hamideh Alizadeh, M. Fakharan, M. Habibi, Samane Rabizadeh, Soheyr Rouhani","doi":"10.46793/match.89-3.653a","DOIUrl":null,"url":null,"abstract":"In this paper, we extend some results of [F. Shaveisi, lower bounds on the vertex cover number and energy of graphs, MATCH Commun. Math. Comput. Chem, 87(3) (2022) 683-692] which state some relations between the vertex cover and other parameters, such as the order and maximum or minimum degree of graphs. Also, we prove that for a graph G, E(G) ≥ 2β(G)−2Ce(G) and so E(G) ≥ 2β(G) − 2C(G), where E(G), β(G), Ce(G) and C(G) denote the energy, vertex cover, number of even cycles and number of cycles in G, respectively. For these both inequalities we investigate their equality. Finally, we give some relations between E(G),γ(G) and γt(G), where γ(G) and γt(G) are domination number and total domination number of G, respectively.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"40 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.89-3.653a","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we extend some results of [F. Shaveisi, lower bounds on the vertex cover number and energy of graphs, MATCH Commun. Math. Comput. Chem, 87(3) (2022) 683-692] which state some relations between the vertex cover and other parameters, such as the order and maximum or minimum degree of graphs. Also, we prove that for a graph G, E(G) ≥ 2β(G)−2Ce(G) and so E(G) ≥ 2β(G) − 2C(G), where E(G), β(G), Ce(G) and C(G) denote the energy, vertex cover, number of even cycles and number of cycles in G, respectively. For these both inequalities we investigate their equality. Finally, we give some relations between E(G),γ(G) and γt(G), where γ(G) and γt(G) are domination number and total domination number of G, respectively.
期刊介绍:
MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.