Zobrazeno 1 - 10
of 16
pro vyhledávání: '"K K Kanani"'
Autor:
K K Kanani, N. B. Rathod
Publikováno v:
Recent Advancements in Graph Theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c0aa4f4e500aa78befee2d04746571a
https://doi.org/10.1201/9781003038436-5
https://doi.org/10.1201/9781003038436-5
Autor:
K K Kanani, N. B. Rathod
Publikováno v:
International Journal of Mathematics Trends and Technology. 34:5-8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52eec727117c82940da765d9bfd01657
https://doi.org/10.14445/22315373/ijmtt-v34p502
https://doi.org/10.14445/22315373/ijmtt-v34p502
Autor:
K K Kanani, N. B. Rathod
Publikováno v:
British Journal of Mathematics & Computer Science. 13:1-15
In this Research article we prove the following results: 1. The crown graph Cn ⊙ K1 is V4-cordial for all n. 2. The armed crown ACn is V4-cordial for all n. 3. The pan graph C n is V4-cordial for all n. 4. The corona graph Cn ⊙ mK1 is V4-cordial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a1a850c3a5b90e415b1bc8d0a521a1b
https://doi.org/10.9734/bjmcs/2016/22004
https://doi.org/10.9734/bjmcs/2016/22004
Autor:
M. V. Modha, K K Kanani
Publikováno v:
British Journal of Mathematics & Computer Science. 13:1-7
In this paper we present k-cordiality of one point union of some path, cycle and star related graphs. We prove that bistar graph Bm;n is k-cordial for all k, restricted square graph B 2 of Bistar is k-cordial for all k. We prove that one point union
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f4c6ca6d2e15d0dc0893204dee22729
https://doi.org/10.9734/bjmcs/2016/21768
https://doi.org/10.9734/bjmcs/2016/21768
Publikováno v:
Journal of Scientific Research. 1:438-449
We present here cordial and 3-equitable labeling for the graphs obtained by joining apex vertices of two shells to a new vertex. We extend these results for k copies of shells.Keywords: Cordial labeling; 3-equitable labeling; Shell.© 2009 JSR Public
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d892f39a9c31b3c8e88c3599db6e9e05
https://doi.org/10.3329/jsr.v1i3.2227
https://doi.org/10.3329/jsr.v1i3.2227
Autor:
T M Chhaya, K K Kanani
Publikováno v:
International Journal of Mathematics and Soft Computing. 7:13
In this paper we investigate strongly multiplicative labeling of some standard graphs. We prove that helm, flower graph, fan, friendship graph and bistar are strongly multiplicative. We also prove that gear graph, double triangular snake, double fan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbb8225316dc6c0ba1a6aa1d2e68061f
https://doi.org/10.26708/ijmsc.2017.1.7.02
https://doi.org/10.26708/ijmsc.2017.1.7.02
Autor:
Mohit Ishvarlal Bosmia, K K Kanani
Publikováno v:
International Journal of Mathematics and Soft Computing. 6:163
The present authors are motivated by two research articles "Di- visor Cordial Graphs" by Varatharajan et al. and "Square Divisor Cordial Graphs" by Murugesan et al. We introduce the concept of cube divisor cor- dial labeling. A cube divisor cordial l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57aa6db26daa2d5d0f53d0fc6956e314
https://doi.org/10.26708/ijmsc.2016.1.6.14
https://doi.org/10.26708/ijmsc.2016.1.6.14
Autor:
K K Kanani, G V Ghodasara
Publikováno v:
2011 International Conference on Image Information Processing.
Here we investigate product cordial labeling for the path union of wheels as well as shells. We also prove that the graph obtained by joining two copies of wheel by a path of arbitrary length admits product cordial labeling. Similar result is also ob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5687428355fc6e6d2c76859cc7425a87
https://doi.org/10.1109/iciip.2011.6108917
https://doi.org/10.1109/iciip.2011.6108917
Autor:
K K Kanani, Samir K. Vaidya
Publikováno v:
Journal of Mathematics Research. 2
Here we investigate prime labeling for some cycle related graphs. We also discuss prime labeling in the context of graph operations namely fusion, duplication and vertex switching in cycle Cn.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::234841890b71b4be08e47aaa0d85631e
https://doi.org/10.5539/jmr.v2n2p98
https://doi.org/10.5539/jmr.v2n2p98
Publikováno v:
Journal of Mathematics Research. 2
We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf0a96a639ae1e8fc494f049a9b63d41
https://doi.org/10.5539/jmr.v2n2p28
https://doi.org/10.5539/jmr.v2n2p28