A monotone path in an edge-ordered graph
An edge-ordered graph is an ordered pair (G,f), where G is a graph and f is a bijective function, f:E(G)→{1,2,…,|E(G)|}. A monotone path of length k in (G,f) is a simple path Pk+1:v1v2…vk+1 in G such that either f({vi,vi+1})<f({vi+1,vi+2}) or f({vi,vi+1})>f({vi+1,vi}) for i=1,2,…,k−1....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1987-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171287000383 |
| id |
doaj-3f8b95c64bc94a6994b9621fa2576486 |
|---|---|
| record_format |
Article |
| spelling |
doaj-3f8b95c64bc94a6994b9621fa25764862020-11-24T22:17:48ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251987-01-0110231532010.1155/S0161171287000383A monotone path in an edge-ordered graphA. Bialostocki0Y. Roditty1Department of Mathematics and Applied Statistics, University of Idaho, Moscow 83843, Idaho, USASchool of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, IsraelAn edge-ordered graph is an ordered pair (G,f), where G is a graph and f is a bijective function, f:E(G)→{1,2,…,|E(G)|}. A monotone path of length k in (G,f) is a simple path Pk+1:v1v2…vk+1 in G such that either f({vi,vi+1})<f({vi+1,vi+2}) or f({vi,vi+1})>f({vi+1,vi}) for i=1,2,…,k−1.http://dx.doi.org/10.1155/S0161171287000383edge-orded graphmonotone path. |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
A. Bialostocki Y. Roditty |
| spellingShingle |
A. Bialostocki Y. Roditty A monotone path in an edge-ordered graph International Journal of Mathematics and Mathematical Sciences edge-orded graph monotone path. |
| author_facet |
A. Bialostocki Y. Roditty |
| author_sort |
A. Bialostocki |
| title |
A monotone path in an edge-ordered graph |
| title_short |
A monotone path in an edge-ordered graph |
| title_full |
A monotone path in an edge-ordered graph |
| title_fullStr |
A monotone path in an edge-ordered graph |
| title_full_unstemmed |
A monotone path in an edge-ordered graph |
| title_sort |
monotone path in an edge-ordered graph |
| publisher |
Hindawi Limited |
| series |
International Journal of Mathematics and Mathematical Sciences |
| issn |
0161-1712 1687-0425 |
| publishDate |
1987-01-01 |
| description |
An edge-ordered graph is an ordered pair (G,f), where G is a graph and f is a bijective function, f:E(G)→{1,2,…,|E(G)|}. A monotone path of length k in (G,f) is a simple path Pk+1:v1v2…vk+1 in G such that either f({vi,vi+1})<f({vi+1,vi+2}) or f({vi,vi+1})>f({vi+1,vi}) for i=1,2,…,k−1. |
| topic |
edge-orded graph monotone path. |
| url |
http://dx.doi.org/10.1155/S0161171287000383 |
| work_keys_str_mv |
AT abialostocki amonotonepathinanedgeorderedgraph AT yroditty amonotonepathinanedgeorderedgraph AT abialostocki monotonepathinanedgeorderedgraph AT yroditty monotonepathinanedgeorderedgraph |
| _version_ |
1725784406969286656 |