Results 151 to 160 of about 154,862 (311)

Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem. [PDF]

J Math Biol, 2018
Prohaska SJ, Berkemer SJ, Gärtner F, Gatter T, Retzlaff N, Students of the Graphs and Biological Networks Lab 2017, Höner Zu Siederdissen C, Stadler PF.   +7 more
europepmc   +1 more source

Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path [PDF]

, 2007
Meng Wei, Shengjia Li
openalex   +1 more source

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented graph D $D$ is converse invariant if, for any tournament T $T$, the number of copies of D $D$ in T $T$ is equal to that of its converse −D $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D $D$ with maximum degree at most 2 is converse invariant.
Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +4 more
wiley   +1 more source

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki   +2 more
wiley   +1 more source

Length minimizing paths in the Hamiltonian diffeomorphism group [PDF]

, 2008
Peter Spaeth
openalex   +1 more source

Recognizing Trees From Incomplete Decks

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, the unlabeled subgraphs G − v $G-v$ are called the cards of G $G$. The deck of G $G$ is the multiset { G − v : v ∈ V ( G ) } $\{G-v:v\in V(G)\}$. Wendy Myrvold showed that a disconnected graph and a connected graph both on n $n$ vertices have at most ⌊ n 2 ⌋ + 1 $\lfloor \frac{n}{2}\rfloor +1$ cards in common and found ...
Gabriëlle Zwaneveld
wiley   +1 more source

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

Physical Review Research
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the ...
Amir Kalev, Itay Hen
doaj   +1 more source

A note on K-path hamiltonian graphs

Journal of Combinatorial Theory, 1969
AbstractA graph G on p vertices is k-path Hamiltonian if every path of length not exceeding k, 1≤k≤p−2, is contained in a Hamiltonian cycle of G. Sufficient conditions are presented for a graph to be k-path Hamiltonian.
openaire   +2 more sources

Diagrammatic Schemes for Nonlinear Optical Interactions

Journal of Raman Spectroscopy, EarlyView.
Conventional diagrammatic approaches (blue frames in the figure) to semi‐classical nonlinear optical interactions emphasize either the bra and ket matter states (double‐sided Feynman diagrams and Liouville pathways) or the frequencies of the bra and ket radiative processes between energy levels (Albrecht notation). We propose a field‐type modification (
F. Vergari, F. Mazza, A. Hosseinnia, M. Marrocco   +3 more
wiley   +1 more source

Quantization of Massive Non-Abelian Gauge Fields in The Hamiltonian Path Integral Formalism

, 1998
Jun-Chen Su
openalex   +2 more sources