Zobrazeno 1 - 10
of 172
pro vyhledávání: '"Line digraph"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice prop
Externí odkaz:
https://doaj.org/article/e25bf4662c1a4eee81cc9fb8ac404f92
Autor:
Jay S. Bagga, Lowell W. Beineke
Publikováno v:
Discrete Mathematics Letters, Vol 6, Pp 68-83 (2021)
Externí odkaz:
https://doaj.org/article/d2e73f8bc5e0473bab97e2249feb3511
Autor:
S. Arumugam, Jay S. Bagga
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 660-664 (2020)
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path
Externí odkaz:
https://doaj.org/article/b6a5db2012c44697bcae1d5ebbd3ce2e
Autor:
Rinovia Simanjuntak, Edy Tri Baskoro
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 32, Iss 1 (2019)
Abstract. It is well known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist. For degrees 2 and 3, it has been shown that for diameter k ≥ 3 there are no almost Moore digraphs, i.e. the diregular digraphs of order one less tha
Externí odkaz:
https://doaj.org/article/c079d45acfd84d0795bee77ea9fea526
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:183
A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and outdegree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::687494bbea9a6b1b94e448862f246f92
https://doi.org/10.5614/ejgta.2023.11.1.15
https://doi.org/10.5614/ejgta.2023.11.1.15
Autor:
Subramanian Arumugam, Jay S. Bagga
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 660-664 (2020)
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd262684b27ee2c2f98aea40a616def9
https://doaj.org/article/b6a5db2012c44697bcae1d5ebbd3ce2e
https://doaj.org/article/b6a5db2012c44697bcae1d5ebbd3ce2e
Autor:
Miguel Angel Fiol, Cristina Dalfó
Publikováno v:
Electronic Journal of Graph Theory and Applications
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::744b45d5d2638bd5619839cad3266c9c
https://hdl.handle.net/10459.1/72285
https://hdl.handle.net/10459.1/72285
