Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Futaba Fujie"'
Autor:
ANDREWS, ERIC1 eric.s.andrews@wmich.edu, FUTABA FUJIE2 futaba@math.nagoya-u.ac.jp, KYLE KOLASINSKI kyle.c.kolasinski@wmich.edu, LUMDUANHOM, CHIRA1 chira.lumduanhom@wmich.edu, YUSKO, ADAM1 adam.m.yusko@wmich.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2014, Vol. 34 Issue 1, p5-22. 18p.
Publikováno v:
Discrete Mathematics. 313:2908-2917
Let G be a connected graph of size at least 2 and c : E ( G ) → { 0 , 1 , … , k − 1 } an edge labeling of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G , the color code of v with respect to c is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2656debcbbaaed1e907845455c7ebaf3
https://doi.org/10.1016/j.disc.2013.09.001
https://doi.org/10.1016/j.disc.2013.09.001
Publikováno v:
Graphs and Combinatorics. 29:901-912
Let G be a connected graph of order $${n\ge 3}$$ and size m and $${f:E(G)\to \mathbb{Z}_n}$$ an edge labeling of G. Define a vertex labeling $${f': V(G)\to \mathbb{Z}_n}$$ by $${f'(v)= \sum_{u\in N(v)}f(uv)}$$ where the sum is computed in $${\mathbb{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfeec2ad7d73cb465ba8e77a63c34c8c
https://doi.org/10.1007/s00373-012-1147-1
https://doi.org/10.1007/s00373-012-1147-1
Publikováno v:
Mathematica Bohemica. 137:45-63
For a nontrivial connected graph G of order n, the detour distance D(u,v) between two vertices u and v in G is the length of a longest u v path in G. Detour distanceisametriconthevertexsetof G. Foreachinteger kwith1 6 k 6 n 1, acoloring c: V(G) ! N i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca0367cc68a83591f339e61003af2b70
https://doi.org/10.21136/mb.2012.142787
https://doi.org/10.21136/mb.2012.142787
Autor:
Futaba Fujie, Ping Zhang
Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This
Autor:
Futaba Fujie, Ping Zhang
Publikováno v:
SpringerBriefs in Mathematics ISBN: 9781493903047
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aef9907f6b98c265d6d0d48fbabe7084
https://doi.org/10.1007/978-1-4939-0305-4_1
https://doi.org/10.1007/978-1-4939-0305-4_1
Autor:
Futaba Fujie, Ping Zhang
Publikováno v:
SpringerBriefs in Mathematics ISBN: 9781493903047
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dd3d7ee7e1ecd330db2aeae43bb76b3
https://doi.org/10.1007/978-1-4939-0305-4_2
https://doi.org/10.1007/978-1-4939-0305-4_2
Autor:
Futaba Fujie, Ping Zhang
Publikováno v:
SpringerBriefs in Mathematics ISBN: 9781493903047
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2979372ea59b3dfad97ddb9a69edf51c
https://doi.org/10.1007/978-1-4939-0305-4_3
https://doi.org/10.1007/978-1-4939-0305-4_3
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 237-247 (2015)
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd62de3c175cb4a8cd1b94cfb4c08018
https://doi.org/10.7151/dmgt.1792
https://doi.org/10.7151/dmgt.1792
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 1, Pp 5-22 (2014)
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c117d698567b483e7464f6801209cd54
https://doi.org/10.7151/dmgt.1725
https://doi.org/10.7151/dmgt.1725