Results 21 to 30 of about 3,088,840 (140)
Shui kexue jinzhanThis study aimed to address challenges associated with diverse dam failure triggers，complex transmission pathways，and difficulties in quantifying associated losses.
Jinjun ZHOU +4 more
doaj +1 more source
Modelling epidemics on d-cliqued graphs
Letters in Biomathematics, 2018 Since social interactions have been shown to lead to symmetric clusters, we propose here that symmetries play a key role in epidemic modelling. Mathematical models on d-ary tree graphs were recently shown to be particularly effective for modelling ...
Laura P. Schaposnik, Anlin Zhang
doaj +1 more source
On comparison between the distance energies of a connected graph
HeliyonLet G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +1 more source
Geometric interaction-based discrete dynamic graph link prediction model
河南理工大学学报. 自然科学版With 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 +3 more
doaj +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +1 more source
Boundary Value Problems on a Star Thermal Graph and their Solutions
Қарағанды университетінің хабаршысы. Математика сериясыIn this study, heat conductivity boundary value problems on a star graph are considered, inspired by engineering applications, e.g., heat conduction phenomena in mesh-like structures.
L.A. Alexeyeva +3 more
doaj +1 more source
On the $D_α$ spectral radius of non-transmission regular graphs
Let $G$ be a connected graph with order $n$ and size $m$. Let $D(G)$ and $Tr(G)$ be the distance matrix and diagonal matrix with vertex transmissions of $G$, respectively. For any real $α\in[0,1]$, the generalized distance matrix $D_α(G)$ of $G$ is defined as $$D_α(G)=αTr(G)+(1-α)D(G).$$ The largest eigenvalue of $D_α(G)$ is called the $D_α$ spectral ...
Xu, Zengzhao, Xi, Weige, Wang, Ligong
openaire +2 more sources
On Almost Distance-Regular Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A. +4 more
core +2 more sources
Distributed Graph Simulation: Impossibility and Possibility [PDF]
, 2014 This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Dilation theory for rank two graph algebras. [PDF]
, 2010 An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more ...
Yang, Dilian +2 more
core +4 more sources