Results 31 to 40 of about 34,618 (252)

On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

open access: yesMathematics, 2021
The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur   +3 more
doaj   +1 more source

On the distance spectral radius of cacti

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

A proof of a conjecture on the distance spectral radius

open access: yesLinear Algebra and its Applications, 2023
A cactus is a connected graph in which any two cycles have at most one common vertex. We determine the unique graph that maximizes the distance spectral radius over all cacti with fixed numbers of vertices and cycles, and thus prove a conjecture on the distance spectral radius of cacti in [S.S. Bose, M. Nath, S. Paul, On the distance spectral radius of
Yanna Wang, Bo Zhou
openaire   +3 more sources

Distance spectral radius of series-reduced trees with parameters [PDF]

open access: yesRAIRO - Operations Research, 2021
For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G. A series-reduced tree is a tree with at least one internal vertex and all internal vertices having degree at least ...
Yuyuan Deng   +3 more
openaire   +1 more source

On graft transformations decreasing distance spectral radius of graphs [PDF]

open access: yesRAIRO - Operations Research, 2021
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. In this paper, we give several less restricted graft transformations that decrease the distance spectral radius, and determine the unique graph with minimum distance spectral radius among home-omorphically irreducible unicylic graphs on n ≥ 6 vertices ...
Yanna Wang, Bo Zhou 0007
openaire   +2 more sources

Soft motions encoded by the fold and mediated by conserved hinge sites drive V‐ATPase allosteric machinery and autoinhibition

open access: yesFEBS Letters, EarlyView.
Vacuolar H+‐ATPase (V‐ATPase) is a multisubunit rotary proton pump that acidifies intracellular compartments. Using elastic network models, we identified conserved hinge residues that govern its large‐scale functional motions. We show that intrinsically encoded ‘soft modes’ drive critical functional transitions, including rotary catalysis and ...
Diksha Parwana   +3 more
wiley   +1 more source

Identification and characterization of a gene conferring stress resistance in Escherichia coli and cyanobacteria

open access: yesFEBS Open Bio, EarlyView.
Functional screening identified PcSyn14890, a cyanobacteria‐specific protein that enhances growth and stress resistance in E. coli and Synechocystis PCC6803. Although we expected it to function as a molecular chaperone, it was unable to protect against thermal aggregation of GAPDH.
Akiyo Yamada   +7 more
wiley   +1 more source

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

open access: yesAdvanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt   +8 more
wiley   +1 more source

Matching extension and distance spectral radius

open access: yesLinear Algebra and its Applications, 2023
A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the $k ...
Yuke Zhang, Edwin R. van Dam
openaire   +3 more sources

Inverse Identification of Energy‐Dependent Laser Absorptivity in NiTi Laser Powder‐Bed Fusion via Calibrated Melt Pool Simulation

open access: yesAdvanced Engineering Materials, EarlyView.
A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy