Zobrazeno 1 - 5
of 5
pro vyhledávání: '"S. A. Kandekar"'
Autor:
S. K. Wakchaure, S. B. Kandekar
Publikováno v:
International Journal of Recent Technology and Engineering (IJRTE). 10:1-6
Materials are the most important component of building construction. The demands of construction material are increasing day by day significantly. This demand is increasing the material prices and scarcity of material in construction industry. To ach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92765decaef59e470f1598b9a9bf9e98
https://doi.org/10.35940/ijrte.b6275.0910321
https://doi.org/10.35940/ijrte.b6275.0910321
Publikováno v:
Journal of Parallel and Distributed Computing. 122:188-194
The spanning trees T 1 , T 2 , … , T k of G are edge-disjoint spanning trees (EDSTs) if they are pairwise edge-disjoint. In addition to it if they are pairwise internally vertex disjoint then they are called completely independent spanning trees (C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04fa95c24fce7f0cf9d507246c2744ed
https://doi.org/10.1016/j.jpdc.2018.08.006
https://doi.org/10.1016/j.jpdc.2018.08.006
In this paper, we consider the problem of decomposing the augmented cube A Q n into two spanning, regular, connected and pancyclic subgraphs. We prove that for n ≥ 4 and 2 n − 1 = n 1 + n 2 with n 1 , n 2 ≥ 2 , A Q n can be decomposed into two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c20a99969dd7c3f44fed0e145120da18
Autor:
Q A Mandeel, A S Narayanan, Kalimuthusamy Natarajaseenivasan, Karuppiah Ponmurugan, A. Maripandi ., S C Kandekar, S. Raja
Publikováno v:
Beneficial microbes. 2(3)
The increasing incidence of antibiotic resistance among bacterial pathogens necessitates medicinal plants as an alternate therapy in restricting the resistant infectious organisms. In this primitive study, the antibiotic resistance of organisms isola
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c24ba5dc188cd2c24531b64e5c11cc3f
https://pubmed.ncbi.nlm.nih.gov/21986363
https://pubmed.ncbi.nlm.nih.gov/21986363
Autor:
S. A. Kandekar, Y. M. Borse
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1550033
In this paper, we consider the problem of decomposing the edge set of the hypercube Qn into two spanning, regular, connected, bipancyclic subgraphs. We prove that if n = n1 + n2 with n1 ≥ 2 and n2 ≥ 2, then the edge set of Qn can be decomposed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::747507a710a540017f88e2aa9b28bcb7
https://doi.org/10.1142/s1793830915500330
https://doi.org/10.1142/s1793830915500330