Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Leonid A. Mel'nikov"'
Publikováno v:
Journal of Graph Theory. 59:279-292
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07f245f52618e06e453978bda977f022
https://doi.org/10.1002/jgt.20339
https://doi.org/10.1002/jgt.20339
Publikováno v:
Discrete Mathematics. 307:1538-1544
Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in V(G) which are of the same vertex-type. We will show tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4bfeeb1281ad12572e5d16d0d41eb39
https://doi.org/10.1016/j.disc.2005.11.091
https://doi.org/10.1016/j.disc.2005.11.091
Publikováno v:
Discrete Mathematics. 306(6):591-594
Let G be a 4-regular planar graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly on cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of S. Such a graph G arises as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27ac1e3553300d5ffd90752022d0a56f
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:469-475
The Wiener index W ( G ) of a graph G is the sum of distances between all unordered pairs of vertices. This notion was motivated by various mathematical properties and chemical applications. For a tree T, it is known that W ( T ) and W ( L ( T ) ) ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3e0e8b67dd09a0d8e5b8646eb3e9bb2
https://doi.org/10.1016/j.endm.2005.06.081
https://doi.org/10.1016/j.endm.2005.06.081
Publikováno v:
Applied Mathematics Letters. 18:307-312
The Wiener number, W ( G ) , is the sum of the distances of all pairs of vertices in a graph G . Infinite families of graphs with increasing cyclomatic number and the property W ( G ) = W ( L ( G ) ) are presented, where L ( G ) denotes the line grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4b438679334adbcd7e487f5d6f1aa1f
https://doi.org/10.1016/j.aml.2004.03.007
https://doi.org/10.1016/j.aml.2004.03.007
Autor:
Leonid S. Mel'nikov, Artem V. Pyatkin
Publikováno v:
Discrete Mathematics. 252(1-3):237-245
Given a set of integers S, G(S)=(S,E) is a graph, where the edge uv exists if and only if u + v ∈ S . A graph G =( V , E ) is an integral sum graph or ISG if there exists a set S ⊂ Z such that G = G ( S ). This set is called a labeling of G . The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::357ff4a7dcc61dbf608d98f6fc3341a6
Publikováno v:
Discrete Mathematics. 309(8):2564-2566
Let G be a 4-regular plane graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly one cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of S. Such a graph G arises as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73b657861ccb351881fd9569ab6849a6
Autor:
Leonid S. Mel'nikov, Vadim G. Vizing
Publikováno v:
Journal of Graph Theory. 31:267-273
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c3c5ec67d74b5040e935aa26cf9cd01
https://doi.org/10.1002/(sici)1097-0118(199908)31:4<267::aid-jgt1>3.0.co
https://doi.org/10.1002/(sici)1097-0118(199908)31:4<267::aid-jgt1>3.0.co
Publikováno v:
Croatica Chemica Acta
Volume 77
Issue 3
Volume 77
Issue 3
The Wiener index is a topological index defined as the sum of distances between all pairs of vertices in a tree. It was introduced as a structural descriptor for molecular graphs of alkanes, which are trees with vertex degrees of four at the most (ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______951::dc5bd35ee9ff034293debc6fb6e690fd
https://hrcak.srce.hr/102948
https://hrcak.srce.hr/102948
Publikováno v:
Discussiones Mathematicae Graph Theory. 32:617
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e8c097dcb8c299b05d57e0cfbc157ce
https://doi.org/10.7151/dmgt.1630
https://doi.org/10.7151/dmgt.1630