Results 111 to 120 of about 67,270 (298)

On the distance spectral radius of cacti [PDF]

open access: yes, 2012
A cactus is a connected graph in which any two cycles have at most one common vertex. In this article, we determine the unique graph with minimal distance spectral radius in the class of all cacti with n vertices and k cycles.
Paul, Somnath   +2 more
core   +1 more source

Comparison Theorems for Single and Double Splittings of Matrices

open access: yesJournal of Applied Mathematics, 2013
Some comparison theorems for the spectral radius of double splittings of different matrices under suitable conditions are presented, which are superior to the corresponding results in the recent paper by Miao and Zheng (2009).
Cui-Xia Li, Qun-Fa Cui, Shi-Liang Wu
doaj   +1 more source

Three‐Dimensional Anomalous Hall Sensing Enabled By Spin–Orbit Torque Driven Domain Reconfiguration In Chiral Multilayers

open access: yesAdvanced Functional Materials, EarlyView.
A three‐dimensional magnetic field sensor is realized in chiral W/CoFeB/MgO multilayers, where spin–orbit torques reversibly reconfigure homochiral stripe domains. The symmetry of the torque enables offset‐free in‐plane sensing, while the reproducible domain reconfiguration extends the linear out‐of‐plane range. An anomalous Hall readout delivers large‐
Sabri Koraltan   +16 more
wiley   +1 more source

Spectral radius inequalities for positive commutators [PDF]

open access: yes, 2014
summary:We establish several inequalities for the spectral radius of a positive commutator of positive operators in a Banach space ordered by a normal and generating cone.
Zima, Mirosława
core   +1 more source

Spectral radius of bipartite graphs

open access: yesLinear Algebra and its Applications, 2015
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a simple bipartite graph obtained from the complete bipartite graph Kp,q of bipartition orders p and q by deleting k edges is attained when the deleting edges are all incident on a common vertex which is located in the partite set of order q.
Liu, Chia-an, Weng, Chih-wen
openaire   +3 more sources

Intrinsic Photoactive Star ZnPc–Poly(glutamate) Nanoplatforms for Multimodal Glioblastoma Therapy and Brain‐Targeted Delivery

open access: yesAdvanced Functional Materials, EarlyView.
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández   +14 more
wiley   +1 more source

Extremal Unicyclic Graphs With Minimal Distance Spectral Radius

open access: yesDiscussiones Mathematicae Graph Theory, 2014
The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj   +1 more source

X‐Functionality–Driven Photocatalytic Hydrogen Evolution in 2D 4‐X‐PEA2SnI4 Perovskites

open access: yesAdvanced Functional Materials, EarlyView.
We report a water‐based synthesis of 2D 4‐X‐PEA2SnI4 perovskite microcrystals with prominent photocatalytic (PC) activity for H2 production. The synergy between organic functionalization and HI‐derived iodide scavenges holes suppress octahedral distortion, and favor electron accumulation, enabling a PC H2 evolution ∼20 µmol·g−1 and long‐term stability ...
Taeyeon Kim   +21 more
wiley   +1 more source

Spectral radius and Hamiltonicity of graphs with large minimum degree [PDF]

open access: yes, 2016
summary:Let $G$ be a graph of order $n$ and $\lambda ( G) $ the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in $G$. One of the main results of the paper is the following
Nikiforov, Vladimir
core   +1 more source

Developments on spectral characterizations of graphs. [PDF]

open access: yes
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   +4 more sources

Home - About - Disclaimer - Privacy