Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Garry Johns"'
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://doaj.org/article/05ef5d7a7a964d9d8f44381c8bdd5905
Autor:
Garry Johns, Karen Sleno
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 16, Iss 3, Pp 579-586 (1993)
The antipodal graph of a graph G, denoted by A(G), has the same vertex set as G with an edge joining vertices u and v if d(u,v) is equal to the diameter of G. (If G is disconnected, then diam G=∞.) This definition is extended to a digraph D where t
Externí odkaz:
https://doaj.org/article/8b68a79ed7ae4e35bff4154fd3337ab8
Autor:
Farrokh Saba, Garry Johns
Publikováno v:
Annals of the New York Academy of Sciences. 576:275-280
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::277a8e6bb65dd0ef2c60e4440b6f4ebd
https://doi.org/10.1111/j.1749-6632.1989.tb16408.x
https://doi.org/10.1111/j.1749-6632.1989.tb16408.x