Results 51 to 60 of about 6,109 (206)
Bicyclic molecular graphs with the greatest energy [PDF]
Journal of the Serbian Chemical Society, 2008 The molecular graph Qn is obtained by attaching hexagons to the end vertices of the path graph Pn-12. Earlier empirical studies indicated that Qn has greatest energy among all bicyclic n-vertex (molecular) graphs.
Furtula Boris +2 more
doaj +3 more sources
Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study
Future Internet, 2023 Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology.
Martin Kenyeres, Jozef Kenyeres
doaj +1 more source
Bipartite Kneser Graphs are Hamiltonian [PDF]
Combinatorica, 2015 ISSN:1439 ...
Mütze Torsten, Su Pascal
openaire +4 more sources
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
AIChE Journal, EarlyView.Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Restricted Tweedie stochastic block models
Canadian Journal of Statistics, EarlyView.Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +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
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
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
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source