Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Steven J. Winters"'
Publikováno v:
São Paulo Journal of Mathematical Sciences. 16:893-914
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a13917a3256fa294f4c76b8b1f5e76cb
https://doi.org/10.1007/s40863-022-00296-x
https://doi.org/10.1007/s40863-022-00296-x
Publikováno v:
Journal of Discrete Mathematics. 2014:1-9
The classic puzzle of finding a closed knight’s tour on a chessboard consists of moving a knight from square to square in such a way that it lands on every square once and returns to its starting point. The 8 × 8 chessboard can easily be extended
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::409c81e9f36cc2c9fb59b00dbde988d6
https://doi.org/10.1155/2014/210892
https://doi.org/10.1155/2014/210892
Publikováno v:
Acta Mathematica Sinica, English Series. 28:439-452
A delivery person must leave the central location of the business, deliver packages at a number of addresses, and then return. Naturally, he/she wishes to reduce costs by finding the most efficient route. This motivates the following
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc4b800804c041307ffa7208be103367
https://doi.org/10.1007/s10114-011-0187-4
https://doi.org/10.1007/s10114-011-0187-4
Publikováno v:
Mathematica Bohemica. 134:99-110
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ac61ed19edf04de3f9c17b38e53259f
https://doi.org/10.21136/mb.2009.140644
https://doi.org/10.21136/mb.2009.140644
Publikováno v:
Mathematica Bohemica. 134:387-398
P. Kristiansen, S. M. Hedetniemi, and S. T. Hedetniemi, in Alliances in graphs, J.\ Combin.\ Math.\ Combin.\ Comput.\ 48 (2004), 157--177, and T. W. Haynes, S. T. Hedetniemi, and M. A. Henning, in Global defensive alliances in graphs, Electron.\ J.\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e71d04f1712c030c31d11cc9934fe86f
https://doi.org/10.21136/mb.2009.140671
https://doi.org/10.21136/mb.2009.140671
Autor:
Steven J. Winters
Publikováno v:
Czechoslovak Mathematical Journal. 51:831-846
The directed distance d(u,v) from u to v in a strong digraph D is the length of a shortest u-v path in D. The eccentricity e(v) of a vertex v in D is the directed distance from v to a vertex furthest from v in D. The center and periphery of a strong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84b2f45acc0ed47560daad3e4aadde70
https://doi.org/10.1023/a:1013773131168
https://doi.org/10.1023/a:1013773131168
Publikováno v:
Networks. 38:33-38
The central distance of a central vertex v in a connected graph G with rad G < diam G is the largest nonnegative integer n such that whenever x is a vertex with d(v, x) ≤ n then x is also a central vertex. The subgraph induced by those central vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d4dd0463246adb2c6e683b24997e86c
https://doi.org/10.1002/net.1021
https://doi.org/10.1002/net.1021
Autor:
Steven J. Winters, Karen Klemm
Publikováno v:
Networks. 34:279-282
The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u-v path in G. The distance of a vertex v of G is the sum of the distances from v to the vertices of G. For a vertex v in a 2-edge-connected graph G, we def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ed57f0086ec076fa791b2c784edb50c
https://doi.org/10.1002/(sici)1097-0037(199912)34:4<279::aid-net7>3.0.co
https://doi.org/10.1002/(sici)1097-0037(199912)34:4<279::aid-net7>3.0.co
Publikováno v:
Networks. 28:181-186
The eccentricity e(v) of a vertex v in a connected graph G is the distance between v and a vertex furthest from v. The minimum eccentricity among the vertices of G is the radius rad G of G, and the maximum eccentricity is its diameter diam G. A verte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7a76be6b39c921dc0a0d87fcd0e4620
https://doi.org/10.1002/(sici)1097-0037(199612)28:4<181::aid-net2>3.0.co
https://doi.org/10.1002/(sici)1097-0037(199612)28:4<181::aid-net2>3.0.co
Publikováno v:
Journal of Graph Theory. 17:509-521
The directed distance dD(u, v) from a vertex u to a vertex v in a strong digraph D is the length of a shortest (directed) u - v path in D. The eccentricity of a vertex v in D is the directed distance from v to a vertex furthest from v. The distance o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f32bdf427ccb9c224e72a11f513ac0f
https://doi.org/10.1002/jgt.3190170408
https://doi.org/10.1002/jgt.3190170408