Zobrazeno 1 - 7
of 7
pro vyhledávání: '"G. R. Ganesh"'
Publikováno v:
JP Journal of Heat and Mass Transfer. 32:95-120
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 2634-2645 (2022)
Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and charac
Publikováno v:
JP Journal of Heat and Mass Transfer. 22:133-149
Autor:
G. R. Ganesh, W. Sridhar
Publikováno v:
Frontiers in Heat and Mass Transfer. 16
Publikováno v:
Proceeding of First Doctoral Symposium on Natural Computing Research ISBN: 9789813340725
Many fields must define simplified and effective networks to obtain required forms of output. In this paper, the products of a very strongly perfect graph (VSPG) are considered. This paper presents products on connected simple graphs G1 and G2 with n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c6d0d40da27c59f1c7be1709feac4b9
https://doi.org/10.1007/978-981-33-4073-2_14
https://doi.org/10.1007/978-981-33-4073-2_14
Publikováno v:
INTERNATIONAL JOURNAL OF MECHANICAL ENGINEERING AND TECHNOLOGY (IJMET). 11
Publikováno v:
Journal of Physics: Conference Series. 1770:012074
A graph G is supposed to be trivially perfect if, in each induced subgraph H of G, the number of maximal cliques in H equivalents to the size of a maximum independent set in H. Trivially perfect graphs is subclasses of notable perfect graphs and its