{"title":"图的完全图与其闭包的关系","authors":"S. V. Sarma","doi":"10.15520/ajcem.2014.vol3.iss6.15.pp79-81","DOIUrl":null,"url":null,"abstract":"In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this paper I would like to prove that Every Complete Graph ‘G’ is Hamiltonian then its Closure of Graph is also Hamiltonian. Key words : Graph, Euler Graph, Hamiltonian graph, Complete Graph, Closure of a Graph.","PeriodicalId":173381,"journal":{"name":"Asian Journal of Current Engineering and Maths","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relation Between Complete Graph And Its Closure Of A Graph\",\"authors\":\"S. V. Sarma\",\"doi\":\"10.15520/ajcem.2014.vol3.iss6.15.pp79-81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this paper I would like to prove that Every Complete Graph ‘G’ is Hamiltonian then its Closure of Graph is also Hamiltonian. Key words : Graph, Euler Graph, Hamiltonian graph, Complete Graph, Closure of a Graph.\",\"PeriodicalId\":173381,\"journal\":{\"name\":\"Asian Journal of Current Engineering and Maths\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-01-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Journal of Current Engineering and Maths\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15520/ajcem.2014.vol3.iss6.15.pp79-81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Journal of Current Engineering and Maths","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15520/ajcem.2014.vol3.iss6.15.pp79-81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Relation Between Complete Graph And Its Closure Of A Graph
In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this paper I would like to prove that Every Complete Graph ‘G’ is Hamiltonian then its Closure of Graph is also Hamiltonian. Key words : Graph, Euler Graph, Hamiltonian graph, Complete Graph, Closure of a Graph.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
