Results 51 to 60 of about 13,640 (282)
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source
Spectral properties of the commuting graphs of certain groups
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +1 more source
On the Decomposition of the Laplacian on Metric Graphs [PDF]
Annales Henri Poincaré, 2020 36 ...
Jonathan Breuer, Netanel Levi
openaire +3 more sources
Dual Activation of H2 and CO2 by a Pincer‐Type Ni–Zn Heterobimetallic Complex
Angewandte Chemie, EarlyView.A bimetallic Ni−Zn complex performs sequential activations of H2 (1 equiv) and CO2 (2 equiv). This bimetallic cooperativity is attributed to the weak Lewis acidic nature of Zn(II), which promotes fluxional ligand binding. Namely, an X‐type ligand at Ni, where X is hydride or formate, toggles between two different binding modes: bridging Zn(μ‐X)Ni and ...
Krishnendu Dey +3 more
wiley +2 more sources
On Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs [PDF]
The Electronic Journal of Combinatorics, 2010 Let $G$ be a graph of order $n$ with signless Laplacian eigenvalues $q_1, \ldots,q_n$ and Laplacian eigenvalues $\mu_1,\ldots,\mu_n$. It is proved that for any real number $\alpha$ with $0 < \alpha\leq1$ or $2\leq\alpha < 3$, the inequality $q_1^\alpha+\cdots+ q_n^\alpha\geq \mu_1^\alpha+\cdots+\mu_n^\alpha$ holds, and for any real number ...
Saieed Akbari +3 more
openaire +3 more sources
On Laplacian Eigenvalues of Wheel Graphs
Symmetry, 2023 Consider G to be a simple graph with n vertices and m edges, and L(G) to be a Laplacian matrix with Laplacian eigenvalues of μ1,μ2,…,μn=zero. Write Sk(G)=∑i=1kμi as the sum of the k-largest Laplacian eigenvalues of G, where k∈{1,2,…,n}. The motivation of this study is to solve a conjecture in algebraic graph theory for a special type of graph called a ...
Manal Alotaibi +2 more
openaire +1 more source
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source
On the Laplacian energy of a graph [PDF]
, 1984 summary:In this paper we consider the energy of a simple graph with respect to its Laplacian eigenvalues, and prove some basic properties of this energy.
Cvetković, Dragoš +2 more
core +1 more source
Harnessing Digital Microstructure for Simulation‐Guided Optimization of Permanent Magnets
Advanced Intelligent Discovery, EarlyView.An experimental‐to‐computational workflow is presented that transforms experimental 3D focused ion beam‐scanning electron microscopy data into a simulation‐ready digital microstructure for multiphase functional materials. Using heavy‐rare‐earth‐free Nd–Fe–B magnets as a model system, the approach quantifies grain connectivity across complex secondary ...
Nikita Kulesh +4 more
wiley +1 more source
3D time series analysis of cell shape using Laplacian approaches [PDF]
, 2013 Background: Fundamental cellular processes such as cell movement, division or food uptake critically depend on cells being able to change shape. Fast acquisition of three-dimensional image time series has now become possible, but we lack efficient tools
Stephens, Len R. +7 more
core +1 more source