Zobrazeno 1 - 10
of 96
pro vyhledávání: '"S. Arockiaraj"'
Publikováno v:
Baghdad Science Journal, Vol 20, Iss 1(SI) (2023)
Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A
Externí odkaz:
https://doaj.org/article/73ae506987724c4dbaf85361e970969c
Autor:
A. Meena Kumari, S. Arockiaraj
Publikováno v:
Songklanakarin Journal of Science and Technology (SJST), Vol 42, Iss 6, Pp 1397-1406 (2020)
A (1,0,0)-F-Face magic mean labeling is an assignment of labels to the vertices of planar graph such that the mean weight of each face including an exterior face is constant. In this paper, the existence of (1,0,0)-F-face magic mean labeling is pro
Externí odkaz:
https://doaj.org/article/17526b29f34d4230bfb7d2278e81de5b
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 225-233 (2019)
The Steiner n-antipodal graph of a graph G on p vertices, denoted by SAn(G), has the same vertex set as G and any n(2 ≤ n ≤ p) vertices are mutually adjacent in SAn(G) if and only if they are n-antipodal in G. When G is disconnected, any n vertic
Externí odkaz:
https://doaj.org/article/b91a4c090d41403e8b1ae8eb7128e416
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 2 (2015)
An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=\{1,3,5,\dots,2q-1\}.$ A graph is said to be an od
Externí odkaz:
https://doaj.org/article/e4c347244cfb40119de43e92ed318362
Publikováno v:
International Journal of Interactive Mobile Technologies (iJIM); Vol. 16 No. 20 (2022); pp. 34-58
Sensor nodes in wireless sensor networks (WSN) are used for perceiving, monitoring, and controlling a wide range of applications. Owing to the small size of sensor nodes and limited power sources, energy saving is critical for ensuring network longev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3db57fae0a75a6ac42685ccf7c00ac15
https://doi.org/10.3991/ijim.v16i20.31111
https://doi.org/10.3991/ijim.v16i20.31111
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
PROCEEDINGS OF THE 2022 4TH INTERNATIONAL CONFERENCE ON SUSTAINABLE MANUFACTURING, MATERIALS AND TECHNOLOGIES.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e86473f991a717f3a24a89bcc78af97
https://doi.org/10.1063/5.0142290
https://doi.org/10.1063/5.0142290
Publikováno v:
Linear and Multilinear Algebra. 71:5-15
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1957439c53cd281e8f870e9985b0aacb
https://doi.org/10.1080/03081087.2021.2015274
https://doi.org/10.1080/03081087.2021.2015274
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discrete Applied Mathematics. 285:252-260
The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the least eigen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb7bdddc9a2cad022fb733ce8b2950d4
https://doi.org/10.1016/j.dam.2020.05.029
https://doi.org/10.1016/j.dam.2020.05.029