Results 121 to 130 of about 1,011,259 (278)
A dynamic programming approach for distributing quantum circuits by\n bipartite graphs [PDF]
, 2020 Zohreh Davarzani +3 more
openalex +1 more source
Forest type influence on Heliconia‐dipteran interaction networks
Insect Conservation and Diversity, EarlyView.Responses to forest type depended on the developmental stage of dipterans. Bract traits and forest type influenced larval abundance, but forest type had no impact on adult alpha and beta diversity. Heliconia‐dipteran interaction networks showed a nested pattern for both forest types.
Diana M. Méndez‐Rojas +5 more
wiley +1 more source
Forced Multi-Agent Bipartite Consensus Control: Application to Quadrotor Formation Flying
IEEE AccessThis work investigates the multi-agent bipartite consensus problem in the presence of switching antagonistic interactions. For leaderless multi-agent systems communicating over a structurally balanced sign graph with switching antagonistic interactions ...
Jose A. Guerrero +3 more
doaj +1 more source
Feedback vertex set on chordal bipartite graphs [PDF]
Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest.
Kloks, Ton +2 more
core
Distance Biregular Bipartite Graphs
European Journal of Combinatorics, 1994 A bipartite connected graph \(B\) is called distance biregular if for every pair of vertices \(x,y\) the number of neighbours \(z\) of \(y\) such that \(d(x,z) = d(x,y) - 1\) depends only on the distance \(d(x,y)\) and the stable components containing \(x\) and \(y\). In particular all vertices of the stable component \(G\) resp.
openaire +2 more sources
Chromatic number and regular subgraphs
Bulletin of the London Mathematical Society, EarlyView.Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer +2 more
wiley +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Relations between ordinary energy and energy of a self-loop graph
HeliyonLet G be a graph on n vertices with vertex set V(G) and let S⊆V(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S.
B.R. Rakshith +3 more
doaj +1 more source
The $z$-matching problem on bipartite graphs
, 2018 The $z$-matching problem on bipartite graphs is studied with a local algorithm. A $z$-matching ($z \ge 1$) on a bipartite graph is a set of matched edges, in which each vertex of one type is adjacent to at most $1$ matched edge and each vertex of the ...
Zhao, Jin-Hua
core
Recognizing Graphs Close to Bipartite Graphs
, 2017 We continue research into a well-studied family of problems that ask if the vertices of a graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We let G be the class of k-degenerate graphs.
Bonamy, Marthe +4 more
openaire +4 more sources