{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:41:54Z","timestamp":1765806114384,"version":"3.37.0"},"reference-count":28,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":43,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Science and Engineering Research Board (SERB), Government of India for funding under the Teachers Associateship for Research Excellence","award":["TAR\/2023\/000041"],"award-info":[{"award-number":["TAR\/2023\/000041"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,12,23]]},"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>Finding a minimum-sized set of vertices in a graph such that each edge in the graph is incident to at least one vertex in the set is the objective of the study of vertex cover problem. Mathematically, a vertex cover of a graph <jats:italic>G<\/jats:italic> is a set <jats:italic>S<\/jats:italic> of vertices in <jats:italic>G<\/jats:italic> such that every edge of <jats:italic>G<\/jats:italic> has at least one end vertex in <jats:italic>S<\/jats:italic>. The vertex covering number denoted by <jats:italic>\u03b2<\/jats:italic>(<jats:italic>G<\/jats:italic>) is the minimum cardinality taken over all vertex covering sets of <jats:italic>G<\/jats:italic>. In this paper, we obtain the vertex cover number of certain architectures such as hypertrees, glued trees, triangular graphs, and honeycomb rectangular torus.<\/jats:p>","DOI":"10.1051\/ro\/2024231","type":"journal-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:43:08Z","timestamp":1735821788000},"page":"397-408","source":"Crossref","is-referenced-by-count":1,"title":["Vertex cover number in diverse graph architectures"],"prefix":"10.1051","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3564-2305","authenticated-orcid":false,"given":"Anitha","family":"J.","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9721-9505","authenticated-orcid":false,"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"R. Sundara","family":"Rajan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8717-9530","authenticated-orcid":false,"given":"Hossein","family":"Rashmanlou","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"Alimonti","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/s13721-019-0193-5","volume":"8","author":"Angel","year":"2019","journal-title":"Netw. Model. Anal. Health Inf. Bioinf."},{"key":"R3","first-page":"863","volume":"101","author":"Angel","year":"2015","journal-title":"Int. J. Pure Appl. Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"2163","DOI":"10.1007\/s11277-016-3367-9","volume":"94","author":"Angel","year":"2017","journal-title":"Wireless Pers. Commun."},{"key":"R5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.orl.2006.03.014","volume":"35","author":"Avis","year":"2007","journal-title":"Oper. Res. Lett."},{"key":"R6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","volume":"109","author":"Bar-Yehuda","year":"1985","journal-title":"North-Holland Math. Stud."},{"key":"R7","first-page":"253","volume":"40","author":"Behsaz","year":"2007","journal-title":"Aus. J. Comb."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Cai S., Su K. and Chen Q., EWLS: a new local search for minimum vertex cover, in Twenty-Fourth AAAI Conference on Artificial Intelligence (2010) 45\u201350.","DOI":"10.1609\/aaai.v24i1.7539"},{"key":"R9","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"Chen","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"R10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.proeng.2016.01.248","volume":"137","author":"Chen","year":"2016","journal-title":"Proc. Eng."},{"key":"R11","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/S0022-0000(03)00075-8","volume":"67","author":"Cheetham","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"R12","first-page":"118","volume":"213","author":"Dagdeviren","year":"2023","journal-title":"Expert Syst. App."},{"key":"R13","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.aml.2011.01.013","volume":"24","author":"DeLaVi\u00f1a","year":"2011","journal-title":"Appl. Math. Lett."},{"key":"R14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(95)00277-4","volume":"162","author":"Dragan","year":"1996","journal-title":"Discrete Math."},{"key":"R15","first-page":"2931","volume":"1","author":"Filiol","year":"2007","journal-title":"Int. J. Comput. Electr. Autom. Control Inf. Eng."},{"key":"R16","first-page":"133","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sec. Math."},{"key":"R17","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1142\/S0129054117500344","volume":"28","author":"Hong","year":"2017","journal-title":"Int. J. Found. Comput. Sci."},{"key":"R18","first-page":"1","volume":"5","author":"Karakostas","year":"2009","journal-title":"Electron. Colloq. Comput. Complexity"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Karp R.M., Reducibility among combinatorial problems, in Complexity of Computer Computations. Springer, Boston, MA (1972) 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R20","first-page":"1","volume":"48","author":"Li","year":"2015","journal-title":"J. Phys. A Math. Theor."},{"key":"R21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10878-019-00454-6","volume":"39","author":"Lingas","year":"2020","journal-title":"J. Comb. Optim."},{"key":"R22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"Savage","year":"1982","journal-title":"Inf. Proccess. Lett."},{"key":"R23","doi-asserted-by":"crossref","first-page":"683","DOI":"10.46793\/match.87-3.683S","volume":"87","author":"Shaveisi","year":"2022","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"R24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1166\/jctn.2014.3388","volume":"11","author":"Wang","year":"2014","journal-title":"J. Comput. Theor. Nanosci."},{"key":"R25","unstructured":"West D.B., Introduction to Graph Theory, 2nd edition. Prentice Hall (2001)."},{"key":"R26","first-page":"1477","volume":"50","author":"Yang","year":"2005","journal-title":"Comput. Math. App."},{"key":"R27","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.comnet.2021.108144","volume":"194","author":"Yigit","year":"2021","journal-title":"Comput. Netw."},{"key":"R28","doi-asserted-by":"crossref","first-page":"7831","DOI":"10.3390\/s23187831","volume":"23","author":"Zhang","year":"2023","journal-title":"Sensors"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024231\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T08:52:35Z","timestamp":1739436755000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":28,"journal-issue":{"issue":"1"},"alternative-id":["ro230877"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024231","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}