Results 91 to 100 of about 38,430 (291)

A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph [PDF]

open access: yes, 2008
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non-bipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its
Peter Rowlinson   +13 more
core   +1 more source

Remarks on an eigenvalue problem associated with the p-Laplace operator

open access: yesElectronic Journal of Differential Equations, 2010
In this article we study eigenvalue problems involving p-Laplace operator and having a continuous family of eigenvalues and at least one isolated eigenvalue.
Alin Galatan, Cezar Lupu, Felician Preda
doaj  

Machine Learning Interatomic Potentials for Energy Materials: Architectures, Training Strategies, and Applications

open access: yesAdvanced Energy Materials, EarlyView.
Machine learning interatomic potentials bridge quantum accuracy and computational efficiency for materials discovery. Architectures from Gaussian process regression to equivariant graph neural networks, training strategies including active learning and foundation models, and applications in solid‐state electrolytes, batteries, electrocatalysts ...
In Kee Park   +19 more
wiley   +1 more source

Probabilistic and Geometric Languages in the Context of the Principle of Least Action [PDF]

open access: yes, 2012
This paper explores the question of the unification of the three basic languages of physics, the geometric language of forces, the geometric language of fields or 4-dimensional space-time, and the probabilistic language of quantum mechanics.
Terekhovich, Vladislav E.
core  

Further results on the least eigenvalue of connected graphs [PDF]

open access: yes, 2011
In this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n⩾k+5) the graphs whose least eigenvalue is minimal.
Tatjana Aleksić   +5 more
core   +3 more sources

Keeping Pace or Falling Behind? The Depth of Latin American Trade Agreements

open access: yesApplied Economic Perspectives and Policy, EarlyView.
ABSTRACT This article examines whether Latin American countries are keeping pace with global trends in trade agreement depth or falling behind. Using 681 agreements (1970–2019), we develop the Depth Index of Trade Agreements (DITA) to weight provisions endogenously through factor analysis based on co‐occurrence patterns.
Raphael Gomes da Silva   +2 more
wiley   +1 more source

The least eigenvalue of a graph with a given domination number [PDF]

open access: yes, 2012
In this paper, we characterize the unique graph whose least eigenvalue achieves the minimum among all graphs with n vertices and domination number γ.
Zhu, Bao-Xuan
core   +1 more source

Optimal design of a bar with an attached mass for maximizing the heat transfer

open access: yesElectronic Journal of Differential Equations, 2012
We maximize, with respect to the cross sectional area, the rate of heat transfer through a bar of given mass. The bar serves as an extended surface to enhance the heat transfer surface of a larger heated known mass to which the bar is attached.
Boris P. Belinskiy   +2 more
doaj  

Enhancing Sustainability Label Effectiveness Through Logo Design Modification: An Analysis of the EU Green Leaf Logo

open access: yesAgribusiness, EarlyView.
ABSTRACT Sustainability labels can help support consumers select more socially and environmentally friendly options, thereby enhancing returns for conscientious producers and promoting the transition to a more sustainable food system. However, consumer confusion regarding labels' meaning undermines their effectiveness.
Monika Hartmann   +4 more
wiley   +1 more source

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph [PDF]

open access: yes, 2010
In this paper we characterize the unique graph whose least eigenvalue attains the minimum among all graphs of a fixed order and a given vertex (edge) independence number or vertex (edge) cover number, and get some bounds for the vertex (edge ...
Tan, Ying-Ying, Fan, Yi-Zheng
core   +1 more source

Home - About - Disclaimer - Privacy