Results 81 to 90 of about 85,296 (298)
Networks, EarlyView.ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann +4 more
wiley +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
Oikos, EarlyView.Few studies have sought to understand the vertical patterns of bat–fruit systems, and therefore, it is not possible to evaluate whether interpretations based on data collected from a single stratum adequately represent the interaction patterns of this system. In this context, we evaluated the dissimilarity in the assemblage of frugivorous bats, plants,
Karolaine Porto Supi +3 more
wiley +1 more source
People and Nature, EarlyView.Abstract The Industrial Revolution triggered rural abandonment in Europe and had a profound impact on land configuration and ecosystem dynamics, mainly the growth of forests at the expense of open agricultural habitats. However, rural abandonment has been asynchronous in space and time, depending on regional socio‐economic dynamics.
Joan Bauzà, Miquel Grimalt, Daniel Oro
wiley +1 more source
Unveiling Hidden Features of Strongly Correlated Quantum Systems Through a Complex‐Network Analysis
Advanced Quantum Technologies, EarlyView.By applying complex network theory, we report a fundamental and previously unobserved phenomenon in the finite‐size Kitaev model: a singular point at which uniform, nonzero entanglement emerges among all fermion pairs, forming a complete entanglement network.
Guillem Llodrà +2 more
wiley +1 more source
Packing trees in complete bipartite graphs
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, EarlyView.The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley +1 more source
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
Theory and Applications of Graphs, 2018 Given a graph $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum number of vertices $n$ for which any $k$-coloring of the complete graph $K_{n}$ contains either a rainbow triangle or a ...
Colton Magnant
doaj +1 more source
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
Journal of Mathematics, 2022 In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
Bipartite 2‐Factorizations of Complete Multipartite Graphs [PDF]
Journal of Graph Theory, 2014 AbstractIt is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2‐factor of K, then there exists a factorization of K into F; except that there is no factorization of K6, 6 into F when F is the union of two disjoint 6‐cycles.
Bryant, Darryn +2 more
openaire +3 more sources