Results 11 to 20 of about 3,088,840 (140)
Unavoidable parallel minors of regular matroids [PDF]
, 2011 This is the post-print version of the Article - Copyright @ 2011 ElsevierWe prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M (K_{3,k}), M(W_k), M(K_k), the cycle matroid of
Chun, Carolyn +5 more
core +1 more source
On the Largest Distance (Signless Laplacian) Eigenvalue of Non-transmission-regular Graphs
The Electronic Journal of Linear Algebra, 2018 Let $G=(V(G),E(G))$ be a $k$-connected graph with $n$ vertices and $m$ edges. Let $D(G)$ be the distance matrix of $G$. Suppose $\lambda_1(D)\geq \cdots \geq \lambda_n(D)$ are the $D$-eigenvalues of $G$. The transmission of $v_i \in V(G)$, denoted by $Tr_G(v_i)$ is defined to be the sum of distances from $v_i$ to all other vertices of $G$, i.e., the ...
Liu, Shuting, Shu, Jinlong, Xue, Jie
openaire +2 more sources
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
Modeling epidemics on a regular tree graph
Letters in Biomathematics, 2016 We will first provide a brief introduction to models of disease transmission on so-called contact networks, which can be represented by various structures from the mathematical field of graph theory.
Claire Seibold, Hannah L. Callender
doaj +1 more source
Rotation-based schedules in elementary schools to prevent COVID-19 spread: a simulation study
Scientific Reports, 2023 Rotations of schoolchildren were considered as a non-pharmacological intervention in the COVID-19 pandemic. This study investigates the impact of different rotation and testing schedules.We built an agent-based model of interactions among pupils and ...
Cyril Brom +10 more
doaj +1 more source
Adaptive Product Space Discrete Dynamic Graph Link Prediction Model [PDF]
Jisuanji kexue yu tansuoWith the widespread application of complex network analysis in many fields, such as recommendation systems, social networks, disease transmission networks, and financial transaction networks, the analysis of dynamic graphs has become a key challenge in ...
CHEN Xu, ZHANG Qi, WANG Shuyang, JING Yongjun
doaj +1 more source
Extending Graph Pattern Matching with Regular Expressions
, 2020 Graph pattern matching, which is to compute the set M(Q, G) of matches of Q in G, for the given pattern graph Q and data graph G, has been increasingly used in emerging applications e.g., social network analysis.
Xin Wang +9 more
core +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
Antimagic labeling of regular graphs
, 2016 A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
core +1 more source
Construction and Application of Knowledge Graph for Complex Water Networks:Case Study of Beijing Section of the Middle Route of South-to-North Water Diversion Project [PDF]
长江科学院院报[Objective] This study aims to address two core challenges in the digital governance of complex water networks: insufficient integration of physical topological relationships with multidimensional hydraulic characteristics, and limited multi-level ...
CHENG Xue-jun, WANG Ren-zhong, HU Xiao-bin, XU Jian, XIAO Xiao, LI Guo-zhong
doaj +1 more source