Results 81 to 90 of about 1,624,240 (288)

Bipartite subgraphs and the signless Laplacian matrix [PDF]

open access: yes, 2011
For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue.
Debdas Paul, Steve Kirkland
core   +1 more source

On structural controllability in complex networks with periodic switching topologies

open access: yesAsian 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

On minors of the compound matrix of a Laplacian

open access: yesLinear Algebra and its Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

From Charge‐Transfer Adducts to (Tri)Halide‐Templated Supramolecular Cages: Covalent vs Ionic Products in the Reactions of Pyridin‐4‐ylthio‐Substituted Tetrathiafulvalene With Dihalogens and Interhalogens

open access: yesChemistry – A European Journal, EarlyView.
The reactions between tetra(pyridin‐4‐ylthio)tetrathiafulvalene and Br2/I2/ICl/IBr led to a variety of products, including a rare example of neutral 1:4 CT adduct and ionic products showing supramolecular cage motifs at (tri)halide templates. The nature of the reaction products was elucidated based on XRD analysis, Raman spectroscopy and QTAIM, NCI ...
Anna Caria   +6 more
wiley   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

A Graph‐Based Generative Artificial Intelligence Methodology for Autocorrection of Utility‐System P&IDs

open access: yesChemie 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

Compact Manifolds With Unbounded Nilpotent Fundamental Groups and Positive Ricci Curvature

open access: yesCommunications 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

Population Pharmacokinetics and Detection Times of Betamethasone After Intravenous, Intramuscular, and Intranasal Jet Administration of Betamethasone Sodium Phosphate in Horses

open access: yesDrug Testing and Analysis, EarlyView.
Betamethasone concentrations in 20 horses from Japan and Germany following IV, IM, and INJ administration of betamethasone phosphate were analyzed using population pharmacokinetic modeling. For IV administration of 0.04 mg/kg q24 h, IPC and IUC were 0.012 and 0.31 ng/mL, respectively; the IUC approximated the IFHA urine ISL (0.20 ng/mL).
Taisuke Kuroda   +9 more
wiley   +1 more source

Presurgical magnetoencephalography‐derived network control metrics distinguish successful hippocampal resection vs sparing in temporal lobe epilepsy

open access: yesEpilepsia, EarlyView.
Abstract Objective Surgical decision‐making in temporal lobe epilepsy (TLE) faces a critical challenge in determining whether the hippocampus can be safely spared during anterior temporal resection, particularly when surgery involves the language‐dominant hemisphere.
Guhan Seshadri NP   +6 more
wiley   +1 more source

A bound for the permanent of the Laplacian matrix

open access: yesLinear 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

Home - About - Disclaimer - Privacy