Results 11 to 20 of about 275,010 (282)
Flows and bisections in cubic graphs [PDF]
Journal of Graph Theory, 2016 A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$ vertices. This
Esperet, Louis +2 more
core +9 more sources
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
CoRR, 2021 MSc thesis of Lior Kalman at the Weizmann ...
Lior Kalman, Robert Krauthgamer
openaire +2 more sources
Circular Flows in Planar Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular $(2+\frac{2}{k})$-flow.
Daniel W. Cranston, Jiaao Li
openaire +3 more sources
Additive bases and flows in graphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number $p$, there is a constant $c$ such that for any $n$, the union (with repetition) of the vectors of any family of $c$ linear bases of $\mathbb{Z}_p^n$ forms an additive basis of $\mathbb{Z}_p^n$ (i.e.
Esperet, Louis +3 more
openaire +6 more sources
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source
Interpreting Message Flow Graphs [PDF]
Formal Aspects of Computing, 1995 Abstract We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess communication that Program Dependence Graphs play for control flow in parallel processes. MFGs have been used to analyse parallel code, and are closely related to Message Sequence Charts and Time Sequence Diagrams in telecommunications systems ...
Ladkin, Peter B., Leue, Stefan
openaire +2 more sources
HGNM: Long-Short Term Flow Graph and Hybrid Graph Neural Network-based Saturation Attack Detection Method [PDF]
Jisuanji gongchengThe separation of the control and data planes in Software Defined Network (SDN) enables its widespread application in large-scale network scenarios such as data centers, the Internet of Things (IoT), and cloud networks.
LI Jiasong, CUI Yunhe, SHEN Guowei, GUO Chun, CHEN Yi, JIANG Chaohui
doaj +1 more source
Measurements of 2-D flow parameters around rectangular prisms arranged at the ground
Budownictwo i Architektura, 2008 Measurements of 2-D flows around a square and a rectangle (ratio 2:1) in wind tunnel have been presented in this paper. The results of these measurements presented here are pressure and standard deviation distributions on the models’ walls, components of
Ewa Błazik-Borowa +4 more
doaj +1 more source
Clustering in Complex Directed Networks [PDF]
, 2006 Many empirical networks display an inherent tendency to cluster, i.e. to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC).
B. Bollobás +9 more
core +4 more sources