Results 1 to 10 of about 17,014 (265)
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cun-Quan Zhang
exaly +2 more sources
Flows and Bisections in Cubic Graphs [PDF]
Journal of Graph Theory, 2017 AbstractA k‐weak bisection of a cubic graph G is a partition of the vertex‐set of G into two parts V1 and V2 of equal size, such that each connected component of the subgraph of G induced by () is a tree of at most vertices. This notion can be viewed as a relaxed version of nowhere‐zero flows, as it directly follows from old results of Jaeger that ...
Louis Espéret, Giuseppe Mazzuoccolo
exaly +6 more sources
Degradation graphs reveal hidden proteolytic activity in peptidomes. [PDF]
PLoS Computational BiologyProtein degradation is a regulated process that reshapes the proteome and generates bioactive peptides. Peptidomics and degradomics enables large-scale measurement of these peptides, yet most data analyses approaches treat peptides as isolated endpoints ...
Erik Hartman +2 more
doaj +2 more sources
Pedestrian Flows Analysis to Create a Sustainable Development Concept for a Metropolitan Area [PDF]
E3S Web of Conferences, 2023 This article presents the results of structuring the territory adjacent to Pryanishnikov Street in the Timiryazevsky District of the Northern Administrative District of Moscow. The key objects of the street road network that form the pedestrian flows are
Altunina Yulia, Boikova Galina
doaj +1 more source
Flows on flow-admissible signed graphs [PDF]
Journal of Combinatorial Theory, Series B, 2021 In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$-flow. Bouchet himself proved that such signed graphs admit nowhere-zero $216$-flows and Zyka further proved that such signed graphs admit nowhere-zero $30$-flows. In this paper we show that every flow-admissible signed graph admits a nowhere-zero 11-
Matt DeVos +5 more
openaire +3 more sources
Simple graph models of information spread in finite populations [PDF]
Royal Society Open Science, 2015 We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs.
Burton Voorhees, Bergerud Ryder
doaj +1 more source
Coherent fans in the space of flows in framed graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Let $G=(V,E)$ be a finite acyclic directed graph. Being motivated by a study of certain aspects of cluster algebras, we are interested in a class of triangulations of the cone of non-negative flows in $G, \mathcal F_+(G)$.
Vladimir I. Danilov +2 more
doaj +1 more source
Acoustic hysteresis in flows with different kinds of relaxation and attenuation [PDF]
Archives of Acoustics, 2022 Graphs in the thermodynamic plane acoustic pressure versus excess acoustic density representing acoustic hysteresis, are considered as indicators of relaxation processes, equilibrium parameters of a flow, and kinds of wave exciters.
Anna Perelomova
doaj +1 more source
Linear Algebraic Relations among Cardinalities of Sets of Matroid Functions
Mathematics, 2023 We introduce a unifying approach for invariants of finite matroids that count mappings to a finite set. The aim of this paper is to show that if the cardinalities of mappings with fixed values on a restricted set satisfy contraction–deletion rules, then ...
Martin Kochol
doaj +1 more source
CoRR, 2021 MSc thesis of Lior Kalman at the Weizmann ...
Lior Kalman, Robert Krauthgamer
openaire +2 more sources