Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Krishnaiyan Thulasiraman"'
Autor:
Ali Zeydi Abdian, Lowell W. Beineke, Krishnaiyan Thulasiraman, Reza Tayebi Khorami, Mohammad Reza Oboudi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 47-52 (2021)
The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle. In this study, we present new classes of multicone graphs that
Externí odkaz:
https://doaj.org/article/b7da5c38100243c0bcfc4b7e2aba01c8
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 755-760 (2020)
System level diagnosis, an area pioneered by Preparata, Metze and Chien, has been a dominant area of research in the broader area of fault-tolerant computing since the proposition of the PMC model. In this paper, we study the fault diagnosis problem
Externí odkaz:
https://doaj.org/article/fecd7fd085344693bd5f53e0f602a0c4
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 606-613 (2020)
A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let and denote a complete graph and a complete bipartite graph, respectively. In this work, it is proved that connected multicone graphs ,
Externí odkaz:
https://doaj.org/article/4fd4e8fc521148c6bb7e8437394cb6cc
Autor:
Ali Zeydi Abdian, Lowell W. Beineke, Mohanmmad Reza Oboudi, Afshin Behmaram, Krishnaiyan Thulasiraman, Saeid Alikhani, Kewen Zhao
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 149-158 (2020)
In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let denote a complete graph on vertices. It is proved
Externí odkaz:
https://doaj.org/article/3df4a6c79d14468dad59854b58c2fe39
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
Externí odkaz:
https://doaj.org/article/619e5d3366314d00a277ca5f54b82809
Autor:
Dun-Wei Cheng, Jo-Yi Chang, Chen-Yen Lin, Limei Lin, Yanze Huang, Krishnaiyan Thulasiraman, Sun-Yuan Hsieh
Publikováno v:
The Journal of Supercomputing. 79:5037-5063
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d91b4ad4549485eca45dcd4a5982d30
https://doi.org/10.1007/s11227-022-04841-5
https://doi.org/10.1007/s11227-022-04841-5
Publikováno v:
Theoretical Computer Science. 891:35-49
A major breakthrough in the diagnosis of t-diagnosable systems occurred when Dahbura and Mason developed a diagnosis algorithm under the PMC model using the matching theory in bipartite graphs. In this paper we introduce a new testing model called th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d715de3208285449c8a1354dae68d1f
https://doi.org/10.1016/j.tcs.2021.08.025
https://doi.org/10.1016/j.tcs.2021.08.025
Autor:
Krishnaiyan Thulasiraman
Publikováno v:
Mathematics for Circuits and Filters ISBN: 9781315214023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42f6fdd567593e8e82ef019e52fc5f16
https://doi.org/10.1201/9781315214023-8
https://doi.org/10.1201/9781315214023-8
Publikováno v:
Theoretical Computer Science. 835:44-57
Given two vertices u and v in a connected undirected graph G, a w⁎-container C ( u , v ) is a set of w internally vertex disjoint paths between u and v spanning all the vertices in G. A bipartite graph G is w ⁎ -laceable if there exists a w ⁎ -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b2a3bea64f7a93cc750bff5c1c96f20
https://doi.org/10.1016/j.tcs.2020.05.049
https://doi.org/10.1016/j.tcs.2020.05.049
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 755-760 (2020)
System level diagnosis, an area pioneered by Preparata, Metze and Chien, has been a dominant area of research in the broader area of fault-tolerant computing since the proposition of the PMC model. In this paper, we study the fault diagnosis problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f67d26f4bbb2fd670fb63d03d60a6f75
https://doaj.org/article/fecd7fd085344693bd5f53e0f602a0c4
https://doaj.org/article/fecd7fd085344693bd5f53e0f602a0c4