Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Garry L. Johns"'
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:
Theory and Applications of Graphs, Vol 3, Iss 2 (2016)
An edge coloring of a connected graph G is a proper-path coloring if every two vertices of G are connected by a properly colored path. The minimum number of colors required of a proper-path coloring of G is called the proper connection number pc(G) o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53aaeeede56dfcd399d63c941e872ba0
https://doi.org/10.20429/tag.2017.030202
https://doi.org/10.20429/tag.2017.030202
Publikováno v:
Networks. 54:75-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d69e531c6a884e9a9e3a2dccae88428
https://doi.org/10.1002/net.20296
https://doi.org/10.1002/net.20296
Publikováno v:
Mathematica Bohemica. 133:85-98
Let $G$ be a nontrivial connected graph on which is defined a coloring $c\: E(G) \rightarrow \lbrace 1, 2, \ldots , k\rbrace $, $k \in {\mathbb{N}}$, of the edges of $G$, where adjacent edges may be colored the same. A path $P$ in $G$ is a rainbow pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2259e2ad72e9465b857e94073c5f22df
https://doi.org/10.21136/mb.2008.133947
https://doi.org/10.21136/mb.2008.133947
Autor:
Garry L. Johns
Publikováno v:
Electronic Notes in Discrete Mathematics. 11:410-416
For a connected graph G , the distance d(u, v) between two vertices u and v is the length of a shortest u − v path in G and the distance d(v) of a vertex v is the sum of the distances between v and all vertices of G . The margin, μ (G) , is the su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a20cf6e0b0d9309ea0068d6bbaccc60
https://doi.org/10.1016/s1571-0653(04)00084-8
https://doi.org/10.1016/s1571-0653(04)00084-8
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
Publikováno v:
Discussiones Mathematicae Graph Theory. 32:705
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth power D k of D is that digraph having vertex set V (D) with the property that (u,v) is an arc of D k if the directed distance ~ dD(u,v) from u to v i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bb61a3a5f55f78c45a098cd80c635e0
https://doi.org/10.7151/dmgt.1636
https://doi.org/10.7151/dmgt.1636
Autor:
Tai-Chi Lee, Garry L. Johns
Publikováno v:
Computing in the 90's ISBN: 9780387976280
Great Lakes Computer Science Conference
Great Lakes Computer Science Conference
For a connected graph G, a subset S of V(G) and vertices u, v of G, the S-distance ds(u,v) from u to v is the length of a shortest u — v walk in G that contains every vertex of S. The S-eccentricity es(v) of a vertex v is the maximum S-distance fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25cfa33203fed4b4bb3c0d169e91bcce
https://doi.org/10.1007/bfb0038469
https://doi.org/10.1007/bfb0038469
Publikováno v:
Topics in Combinatorics and Graph Theory ISBN: 9783642469107
The periphery of a graph G is the subgraph of G induced by the vertices in G whose eccentricity equals the diameter of G. Graphs that are peripheries of graphs with specified diameter are characterized. For a graph G, the antipodal graph A(G) of G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03319a401d27e0ab9a70a202b9cc8397
https://doi.org/10.1007/978-3-642-46908-4_22
https://doi.org/10.1007/978-3-642-46908-4_22
Autor:
Garry L. Johns
Publikováno v:
Discrete Mathematics. 128(1-3):399-400
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13fd438a622df023631d53daf6e2c0de