Zobrazeno 1 - 10
of 24
pro vyhledávání: '"P L Vihol"'
Autor:
N. H. Shah, P. L. Vihol
Publikováno v:
Advances and Applications in Discrete Mathematics. 37:21-36
The total domination integrity of a simple connected graph G with no isolated vertices is denoted by TDI(G) and defined as TDI(G)=min { left | S right |+m(G-S) : S subseteq V(G) }, where S is a total dominating set of G and m(G - S) is the order of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::662d0f9fccdff8a32cdf6002c2be63ac
https://doi.org/10.17654/0974165823009
https://doi.org/10.17654/0974165823009
Publikováno v:
Journal of Applied Computer Science & Mathematics, Vol 5, Iss 11, Pp 69-75 (2011)
In the present investigations we prove that the shadow graphs as well as the middle graphs of cycle Cn and path Pn are 3-equitable graphs.
Externí odkaz:
https://doaj.org/article/2968083d565f49d9ab623cedd6c569ef
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:
P L Vihol, Samir K. Vaidya
Publikováno v:
Modern Applied Science. 4
We present here prime cordial labeling for the graphs obtained by some graph operations on given graphs .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f74d52e37b24e02e71f8cbbaed813790
https://doi.org/10.5539/mas.v4n8p119
https://doi.org/10.5539/mas.v4n8p119
Publikováno v:
Journal of Mathematics Research. 2
Let G = ( V ; E ) be a connected graph. For integers j ? k , L ( j ; k )-labeling of a graph G is an integer labeling of the vertices in V such that adjacent vertices receive integers which differ by at least j and vertices which are at distance two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5d4a0f390527732f48861cb56eb97a0
https://doi.org/10.5539/jmr.v2n3p109
https://doi.org/10.5539/jmr.v2n3p109
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
Autor:
P L Vihol, Samir K. Vaidya
Publikováno v:
International Journal of Mathematics and Soft Computing. 2:11
Let $G=(V(G),E(G))$ be a connected graph and let $d(u,v)$ denote the distance between any two vertices in $G$. The maximum distance between any pair of vertices is called the diameter of $G$ denoted by $diam(G)$. A radio labeling( or multilevel dista
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c423bfaa636bccfeeda54a5d98bd8b2
https://doi.org/10.26708/ijmsc.2012.2.2.03
https://doi.org/10.26708/ijmsc.2012.2.2.03
Autor:
Barasara, C. M.1 chirag.barasara@gmail.com, Prajapati, P. J.1 palakprajapati733@gmail.com
Publikováno v:
Advances & Applications in Discrete Mathematics. Apr2022, Vol. 30 Issue 1, p35-58. 24p.
Autor:
Azaizeh, Almothana, Hasni, Roslan, Haddad, Firas, Alsmadi, Mutasem, Alkhasawneh, Raed, Hamad, Asma
Publikováno v:
International Journal of Electrical & Computer Engineering (2088-8708); Aug2022, Vol. 12 Issue 4, p4007-4020, 14p
Autor:
DESHMUKH, UJWALA1 ujwala_deshmukh@rediffmail.com, BHATAVADEKAR, SMITA A.2 smitasj1@gmail.com
Publikováno v:
Journal of Combinatorics, Information & System Sciences. 2016, Vol. 41 Issue 4, p161-197. 19p.