Results 101 to 110 of about 18,314 (299)
A bound for the permanent of the Laplacian matrix
Linear Algebra and its Applications, 1986 Let L(G) be D-A where D is the diagonal matrix of vertex degrees and A the adjacency matrix. The author proves by an explicit formula that the permanent of L is at least 2(n-1)k where k, the complexity, is the number of spanning trees.
openaire +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core +1 more source
On structural controllability in complex networks with periodic switching topologies
Asian Journal of Control, EarlyView.Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
The Laplacian spectral radius of graphs [PDF]
, 2010 summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we improve Shi's upper bound for the Laplacian spectral radius of irregular graphs and present some new bounds for the Laplacian
Jianxi Li +5 more
core +1 more source
SO2 Transfer Enabled by an Easy‐to‐Handle Ionic Liquid
Chemistry – A European Journal, EarlyView.Best of both worlds: The ionic liquid [NEt3Me][Cl(SO2)n] unites the atom economy and low cost of sulfur dioxide with the safety and applicability of common surrogates, streamlining SO2 transfer to access to 3‐sulfolenes, sulfonamides, and SuFEx reagents.
Johanna S. Sturm +11 more
wiley +1 more source
Spectral properties of edge Laplacian matrix
, 2023 Let $N(X)$ be the Laplacian matrix of a directed graph obtained from the edge adjacency matrix of a graph $X.$ In this work, we study the bipartiteness property of the graph with the help of $N(X).$ We computed the spectrum of the edge Laplacian matrix for the regular graphs, the complete bipartite graphs, and the trees.
Chauhan, Shivani +1 more
openaire +3 more sources
Laplacian Invariant Operator in the Matrix Ball [PDF]
, 2020 В статье найден инвариантный оператор Лапласа в матричном шаре и решена задача Дирихле.In article it is considered Laplacian invariant operator in a matrix ball and it is solved the problem of ...
Khudayberganov, Gulmirza Kh. +3 more
core
Chemie Ingenieur Technik, EarlyView.This work explores generative AI for automated revision of Piping and Instrumentation Diagrams (P&IDs). We frame P&ID correction as a translation problem, converting attributed P&ID graphs into sequences and learning revisions with a transformer‐based model.
Lukas Schulze Balhorn +5 more
wiley +1 more source
A quantum algorithm for solving eigenproblem of the Laplacian matrix of a fully connected weighted graph [PDF]
, 2022 Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix operations.
Pan, Shi-Jie +6 more
core +1 more source
Compact Manifolds With Unbounded Nilpotent Fundamental Groups and Positive Ricci Curvature
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT It follows from the work of Kapovitch and Wilking that a closed manifold with nonnegative Ricci curvature has a uniformly almost nilpotent fundamental group. Leftover questions and conjectures, have asked if in this context the fundamental group is actually uniformly almost abelian. The main goal of this work is to construct examples (Mk9,gk)$(
Elia Bruè, Aaron Naber, Daniele Semola
wiley +1 more source