Zobrazeno 1 - 10
of 583
pro vyhledávání: '"Induced path"'
Publikováno v:
Opuscula Mathematica, Vol 43, Iss 3, Pp 393-407 (2023)
The interval function and the induced path function are two well studied class of set functions of a connected graph having interesting properties and applications to convexity, metric graph theory. Both these functions can be framed as special insta
Externí odkaz:
https://doaj.org/article/33c8ec0d204046858607d97a3415fb17
Autor:
Nikolai Beluhov
Publikováno v:
Enumerative Combinatorics and Applications, Vol 3, Iss 2, p Article #S2R16 (2023)
Externí odkaz:
https://doaj.org/article/623fadf5e91e4d50966ba0ee9ed7fe36
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:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 1, Pp 96-109 (2019)
Betweenness is a universal notion present in several disciplines of mathematics. The notion of betweenness has a profound history and many pioneers like Euclid, Pasch, Hilbert have studied betweenness axiomatically. In discrete mathematics too, betwe
Externí odkaz:
https://doaj.org/article/a50427041ba8413ab390574630122cee
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:
Journal of Graph Theory. 100:69-83
An extension of an induced path $P$ in a graph $G$ is an induced path $P'$ such that deleting the endpoints of $P'$ results in $P$. An induced path in a graph is said to be avoidable if each of its extensions is contained in an induced cycle. Beisege
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac17b9a6d3e8631a2a3939996c569eed
https://doi.org/10.1002/jgt.22766
https://doi.org/10.1002/jgt.22766
Autor:
Russell Ricks
Publikováno v:
Algebraic & Geometric Topology. 21:1723-1744
Let k be at most 0, and let X be a locally-finite CAT(k) polyhedral 2-complex X, each face with constant curvature k. Let E be a closed, rectifiably-connected subset of X with trivial first singular homology. We show that E, under the induced path me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31959eb1ec7ed7e18dda4ff4f42d3d9a
https://doi.org/10.2140/agt.2021.21.1723
https://doi.org/10.2140/agt.2021.21.1723
Publikováno v:
Quaestiones Mathematicae. 45:1191-1213
Let $\eta(G)$ be the number of connected induced subgraphs in a graph $G$, and $\overline{G}$ the complement of $G$. We prove that $\eta(G)+\eta(\overline{G})$ is minimum, among all $n$-vertex graphs, if and only if $G$ has no induced path on four ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13b0222a086c7e892d2770b2a1e52146
https://doi.org/10.2989/16073606.2021.1934178
https://doi.org/10.2989/16073606.2021.1934178
Publikováno v:
IET Microwaves, Antennas & Propagation, Vol 15, Iss 5, Pp 495-502 (2021)
Millimetre wave (mmWave) has great potential in vehicle‐to‐vehicle (V2V) communication to provide wide bandwidth and low latency. However, the biggest challenge for the use of mmWave is the high propagation path loss and susceptibility to blockag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f51ad33795d53ad116d2d735d05fc85
https://doi.org/10.1049/mia2.12061
https://doi.org/10.1049/mia2.12061
Autor:
Celso C. Ribeiro, Ruslán G. Marzo
Publikováno v:
RAIRO - Operations Research. 55:333-353
The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems with up to 138 vertices and 493 edges and a heuristic f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::457610303fd2bfcef7d369cc8cdbf571
https://doi.org/10.1051/ro/2021004
https://doi.org/10.1051/ro/2021004