Results 171 to 180 of about 13,640 (282)
Computation of the eigenvalues of complete signed graphs
Electronic Journal of Graph Theory and ApplicationsA signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada +3 more
doaj +1 more source
Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian. [PDF]
SIAM J Imaging Sci, 2020 Cheng X, Mishne G.
europepmc +1 more source
Measuring Frame Evolution: Smoothed Temporal Framing Trajectories in Complex Policy Debates
JCMS: Journal of Common Market Studies, EarlyView.Abstract The European Union faces long‐term governance challenges in contested domains, such as migration management, health data sharing, and facial recognition technology. Across these fields, political debates are shaped by shifting ways in which actors frame problems and solutions. Understanding how such framing contests evolve over time is crucial
Philip Leifeld, Kristijan Garic
wiley +1 more source
The study of the Laplacian Eignvalues of graphs
, 2011 碩士令G為一簡單圖且A(G)為圖G的鄰接矩陣，D(G)為圖G的度對角矩陣，其中對角線元素dii為圖G上的點vi的度數，即dii=deg(vi)。定義L(G)=D(G)–A(G)為圖G的拉普拉斯矩陣，此拉普拉斯矩陣的特徵值稱為圖G的拉普拉斯特徵值。已知任一圖的最小拉普拉斯特徵值必為零且其餘皆為正數，而其最大特徵值又稱為此圖的拉普拉斯譜半徑。 設f(n)為拉普拉斯譜半徑恰等於點數n且所有特徵值皆為整數的連通圖之總個數，Fiedler證明了圖G的拉普拉斯特徵值為其點數若且唯若圖G的補圖是不連通的 ...
戴思平; Tai, Su-Ping
core
Seidel Laplacian and Seidel Signless Laplacian energies of commuting graph for dihedral groups [PDF]
In this paper, we discuss the energy of the commuting graph. The vertex set of the graph is dihedral groups and the edges between two distinct vertices represent the commutativity of the group elements.
Syechah, Bulqis Nebula +3 more
core +1 more source
Examining brain maturation during adolescence using graph Laplacian learning based Fourier transform. [PDF]
J Neurosci Methods, 2020 Wang J +5 more
europepmc +1 more source
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source
Autonomous Frameless Spine Registration and Robot‐Assisted Surgery
Orthopaedic Surgery, EarlyView.Workflow of a contactless, frame‐free, robot‐assisted vertebra registration system. Preoperative CT data establish vertebra {V} and mask {Mpre} coordinate systems. Their relationship is computed, and intraoperatively the robot recognizes the skin‐affixed mask, defining {Mintra}.
Amit Kumar +4 more
wiley +1 more source
Summarizing Complex Graphical Models of Multiple Chronic Conditions Using the Second Eigenvalue of Graph Laplacian: Algorithm Development and Validation. [PDF]
JMIR Med Inform, 2020 Faruqui SHA +7 more
europepmc +1 more source
Quantitative Biology, Volume 14, Issue 3, September 2026.Abstract Genome–phenome association (GPA) prediction can broaden the understanding of biological mechanisms underlying complex phenotypic traits (e.g., diseases and agronomic traits). Traditional deep matrix factorization (DMF)‐based GPA methods can integrate multiple data types and uncover nonlinear associations but often rely on low‐dimensional ...
Ran Duan +4 more
wiley +1 more source