Results 61 to 70 of about 92,446 (202)
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
The scaling of seed‐dispersal specialization in interaction networks across levels of organization
Ecography, EarlyView.Natural ecosystems are characterized by a specialization pattern where few species are common while many others are rare. In ecological networks involving biotic interactions, specialization operates as a continuum at individual, species, and community levels. Theory predicts that ecological and evolutionary factors can primarily explain specialization.
Gabriel M. Moulatlet +3 more
wiley +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Symmetric Bipartite Graphs and Graphs with Loops
, 2014 We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts.
Cairns, Grant, Mendan, Stacey
core +3 more sources
Discrete Mathematics, 2002 The authors consider the problem of finding subgraphs of the complete bipartite graph \(K_{m,n}\) which do not contain a subgraph isomorphic to a copy of \(K_{s,t}\) and are maximal with respect to this property. They translate this problem to the terminology of partial block designs.
Bryant, DE, Fu, HL
openaire +2 more sources
Integrative Conservation, EarlyView.Urbanization may alter bird foraging. Austral Parakeets (Enicognathus ferrugineus) in Patagonia rely on introduced plants in urban areas, especially in winter, despite preferring natives in the wild. This seasonal reliance on introduced species highlights urbanization trade‐offs and underscores the need to manage green areas with native plants to ...
Rocío Bahía +2 more
wiley +1 more source
Groups having complete bipartite divisor graphs for their conjugacy class sizes [PDF]
, 2013 Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers that divide ...
Hafezieh, Roghayeh, Spiga, Pablo
core
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han +3 more
wiley +1 more source
Journal of Robotics, 2020 The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov +3 more
doaj +1 more source
Another Proof of the Generalized Tutte—Berge Formula for f $f$‐Bounded Subgraphs
Journal of Graph Theory, EarlyView.ABSTRACT Given a nonnegative integer weight f ( v ) $f(v)$ for each vertex v $v$ in a multigraph G $G$, an f $f$‐bounded subgraph of G $G$ is a multigraph H $H$ contained in G $G$ such that d H ( v ) ≤ f ( v ) ${d}_{H}(v)\le f(v)$ for all v ∈ V ( G ) $v\in V(G)$.
Zishen Qu, Douglas B. West
wiley +1 more source