ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Physical
Pure sciences
Geography
Chemistry
Mathematics
Geology
Environment
Biology
Research
all records (72)

Languages
English
Portuguese
Spanish
German
French

Countries
Indonesia
USA
Ukraine
Brazil
Italy
Switzerland
India
Czech Republic
Canada
Mexico
all records (68)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
3.601  Articles
1 of 361 pages  |  10  records  |  more records»
Let G be a simple connected graph with vertex set {1,2,...,n} and di denote the degree of vertex i in G. The ABC matrix of G, recently introduced by Estrada, is the square matrix whose ijth entry is v((di+dj-2)/didi); if i and j are adjacent, and zero; ot... see more

This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph parameters like the number of vertices, the number of e... see more

Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived. Some of t... see more

Both the enhancement of the aerosol number concentration and the relative dispersion of the cloud droplet size distribution (spectral dispersion) on a regional scale can modify the cloud reflectivity. This work is focused on the ... see more

Rigidity is the property of a structure that does not flex under an applied force. In the past several decades, the rigidity of graphs has been widely studied in discrete geometry and combinatorics. Laman (1970) obtained a combinatorial characterization o... see more

In this paper, we determine the graphs (respectively, trees) with maximum spectral radius among all graphs (respectively, trees) with zero forcing number at most kk.  As an application, we give a sharp lower bound for the zero forcing number of graph... see more

One of the most important Turán’s theorems establishes an inequality between the maximum clique and the number of edges of a graph. Since 1941, this result has received much attention and many of the different proofs involve induction and a probability di... see more

Daerah Istimewa Yogyakarta (DIY) memiliki tingkat aktivitas seismik yang tinggi, sudah berulang kali mengalami kejadian bencana gempa yang merugikan. Berbagai upaya untuk meminimalisir dampak bencana gempa bumi sudah dilakukan sebelumnya. Salah satunya ya... see more

We consider the weighted digraphs in which the arc weights are positive definite matrices. We obtain some upper bounds for the spectral radius of these digraphs and characterize the digraphs achieving the upper bounds. Some known upper bounds are then spe... see more

1 of 361 pages  |  10  records  |  more records»