Results 1 to 10 of about 2,221,542 (211)
On regular spherical fuzzy graph [PDF]
Journal of Hyperstructures, 2023 A spherical fuzzy set is an advanced extension of clas-sical fuzzy set in which it has an added advantage to deal with awider sense of applicability in uncertain situations. In this paper,regular spherical fuzzy graphs and totally regular spherical fuzzy
B. Mohamed Harif, NAZEERA BEGAM
doaj +1 more source
On strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 7/2, 7/3, 7/4, 7/5, 7/6 [PDF]
Yugoslav Journal of Operations Research, 2021 We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and θ such that |Si ∩ Sj| = τ for any two adjacent vertices i and j, and |Si ∩ Sj| = θ for any
Lepović Mirko
doaj +1 more source
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
Spatio-temporal Graph Convolutional Neural Network: A Deep Learning Framework for Traffic Forecasting [PDF]
International Joint Conference on Artificial Intelligence, 2017 Timely accurate traffic forecast is crucial for urban traffic control and guidance. Due to the high nonlinearity and complexity of traffic flow, traditional methods cannot satisfy the requirements of mid-and-long term prediction tasks and often neglect ...
Ting Yu, Haoteng Yin, Zhanxing Zhu
semanticscholar +1 more source
A note on nearly Platonic graphs with connectivity one
Electronic Journal of Graph Theory and Applications, 2021 A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek,
Dalibor Froncek +3 more
doaj +1 more source
Subdiffusion in the Anderson model on the random regular graph [PDF]
Physical review B, 2019 We study the finite-time dynamics of an initially localized wave-packet in the Anderson model on the random regular graph (RRG). Considering the full probability distribution $\Pi(x,t)$ of a particle to be at some distance $x$ from the initial state at ...
Giuseppe De Tomasi +3 more
semanticscholar +1 more source
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
Proceedings of the Estonian Academy of Sciences, 2023 An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular.
Shangjing Hao, Shixun Lin
doaj +1 more source
Return probability for the Anderson model on the random regular graph [PDF]
Physical review B, 2018 We show that comparing typical and mean values of the return probability one can differentiate between ergodic and multifractal dynamical phases in some random matrix model (power-law random banded matrices and Rosenzweig-Porter matrices), and in the ...
S. Bera +3 more
semanticscholar +1 more source
Graph Signal Processing: History, development, impact, and outlook [PDF]
IEEE Signal Processing Magazine, 2023 Signal processing (SP) excels at analyzing, processing, and inferring information defined over regular (first continuous, later discrete) domains such as time or space.
G. Leus +4 more
semanticscholar +1 more source
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +1 more source