Results 91 to 100 of about 34,455 (233)
Discrete Mathematics, 2000 Let \(G\) denote a strongly-connected digraph with \(n\) nodes, girth \(g\), and diameter \(D\). The author shows that if \(G\) has \(t\) nodes of out-degree one, then \(D\leq n-g+ t\). He also shows that if \(r\) denotes the minimum out-degree of \(G\), then \(g\leq \max\{\lceil n/r\rceil, 2r- 2\}\). This last result implies that when \(n\geq 2r^2- 3r+
openaire +2 more sources
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MARCHIORO P. +3 more
openaire +4 more sources
Precedence‐Constrained Shortest Path
Networks, Volume 86, Issue 3, Page 282-295, October 2025.ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing +2 more
wiley +1 more source
Networks, Volume 86, Issue 3, Page 325-357, October 2025.ABSTRACT The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
wiley +1 more source
On quotient digraphs and voltage digraphs
, 2017 Research of the first two authors is supported by MINECO under project MTM2014-60127-P, and by AGAUR under project 2014SGR1147. The first author has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 734922.
Dalfó Simó, Cristina +3 more
openaire +2 more sources
Modeling and Analyzing Urban Networks and Amenities With OSMnx
Geographical Analysis, Volume 57, Issue 4, Page 567-577, October 2025.ABSTRACT OSMnx is a Python package for downloading, modeling, analyzing, and visualizing urban networks and any other geospatial features from OpenStreetMap data. A large and growing body of literature uses it to conduct scientific studies across the disciplines of geography, urban planning, transport engineering, computer science, and others.
Geoff Boeing
wiley +1 more source
Classical properties of algebras using a new graph association [PDF]
, 2017 We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated algebras, mainly the ...
Aquino, R. M. +4 more
core +1 more source
grENA: Ecological network analysis to assess LEED green buildings’ sustainability
Journal of Industrial Ecology, Volume 29, Issue 5, Page 1776-1790, October 2025.Abstract Sustainability and resilience are essential for extending a building's lifespan and protecting both people and the environment. Leadership in Energy and Environmental Design (LEED) is a widely used green building certification that aims to align projects with future climate and energy goals.
Emily Payne, Astrid Layton
wiley +1 more source
Tree-average distances on certain phylogenetic networks have their weights uniquely determined
Algorithms for Molecular Biology, 2012 A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head.
Willson Stephen J
doaj +1 more source