Results 71 to 80 of about 121,460 (194)
Sandpile Prediction on Undirected Graphs
, 2023 The $\textit{Abelian Sandpile}$ model is a well-known model used in exploring $\textit{self-organized criticality}$. Despite a large amount of work on other aspects of sandpiles, there have been limited results in efficiently computing the terminal state, known as the $\textit{sandpile prediction}$ problem.
Chang, Ruinian +5 more
openaire +2 more sources
Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups [PDF]
, 2013 We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian group.
Cherniavsky, Yonah +2 more
core
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
Mathematics, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
doaj +1 more source
Approximating the Diameter of Planar Graphs in Near Linear Time [PDF]
, 2013 We present a $(1+\epsilon)$-approximation algorithm running in $O(f(\epsilon)\cdot n \log^4 n)$ time for finding the diameter of an undirected planar graph with non-negative edge ...
Weimann, Oren, Yuster, Raphael
core +1 more source
Standard imsets for undirected and chain graphical models
, 2015 We derive standard imsets for undirected graphical models and chain graphical models. Standard imsets for undirected graphical models are described in terms of minimal triangulations for maximal prime subgraphs of the undirected graphs.
Kashimura, Takuya, Takemura, Akimichi
core +1 more source
The Zero-Divisor Graphs of Variation Monogenic Semigroups
Scientific Journal of King Faisal University: Basic and Applied Sciences, 2020 The undirected graph Γ(〖VS〗_Mn) is the zero-divisor graph of the monogenic semigroup SM with zero. The non-zero vertices xi and xj of this graph are adjacent whenever i + j > n and gcd(i,j)=1, where n is the order of Γ(〖VS〗_Mn).
Bana Jawid Al Subaiei +1 more
doaj +1 more source
Forbidden Directed Minors and Kelly-width [PDF]
, 2014 Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K_3 minor.
Kintali, Shiva, Zhang, Qiuyi
core
Tạp chí Khoa học Đại học Đà LạtLet G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph.
Nhu An Do, Quang Tuan Nguyen
doaj +1 more source
Bayesian graphical models for computational network biology
BMC Bioinformatics, 2018 Background Computational network biology is an emerging interdisciplinary research area. Among many other network approaches, probabilistic graphical models provide a comprehensive probabilistic characterization of interaction patterns between molecules ...
Yang Ni, Peter Müller, Lin Wei, Yuan Ji
doaj +1 more source
Learning Graph Structures With Autoregressive Graph Signal Models
IEEE Open Journal of Signal ProcessingThis paper presents a novel approach to graph learning, GL-AR, which leverages estimated autoregressive coefficients to recover undirected graph structures from time-series graph signals with propagation delay.
Kyle Donoghue, Ashkan Ashrafi
doaj +1 more source