Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Leila Badakhshian"'
Publikováno v:
IEEE Access, Vol 7, Pp 94143-94149 (2019)
Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T
Externí odkaz:
https://doaj.org/article/7bf776b2b98e4e81ac8f8dc532769d17
Publikováno v:
Discrete Applied Mathematics. 266:30-37
Consider all k -element subsets and l -element subsets ( k > l ) of an n -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding l -element set is a subset of the corresponding k -element set. Let G k , l denote
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e05999d776c5ff030aa79fad29b89d8c
https://doi.org/10.1016/j.dam.2019.02.006
https://doi.org/10.1016/j.dam.2019.02.006
Publikováno v:
IEEE Access, Vol 7, Pp 94143-94149 (2019)
Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::618688d6fcca214d2b2e116b6db2ddac
https://ieeexplore.ieee.org/document/8756220/
https://ieeexplore.ieee.org/document/8756220/
Publikováno v:
Facta Universitatis, Series: Mathematics and Informatics. :789
A dominating set of a graph G = (V,E) is a subset D of V such that everyvertex not in D is adjacent to at least one vertex in D. A dominating set D is a totaldominating set, if every vertex in V is adjacent to at least one vertex in D. The set Pis sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e066a2201934fd10cb0ad8804a5778fa
https://doi.org/10.22190/fumi1904789m
https://doi.org/10.22190/fumi1904789m