ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Biology
Research
Education
Public health
Mathematics
Geography
Pure sciences
Medicine / Sub specialtie
Environment
Technology
all records (76)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Italy
Ukraine
Denmark
Chile
Australia
Switzerland
Spain
all records (78)

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

Filter  
 
7.940  Articles
1 of 794 pages  |  10  records  |  more records»
The methodology for determining the upper bounds on the homogenized linear elastic properties of cellular solids, described for the two-dimensional case in Dimitrovová and Faria (1999), is extended to three-dimensional open-cell foams. Besides the upper b... see more

This paper aims to develop an optimization approach for deriving the upper and lower bounds of transportation network vulnerability under simultaneous disruptions of multiple links without the need to evaluate all possible combinations as in the enumerati... see more

Let (s2(n))8n=0(s_2(n))_{n=0}^\infty denote Stern's diatomic sequence. For n=2n\geq 2, we may view s2(n)s_2(n) as the number of partitions of n-1n-1 into powers of 22 with each part occurring at most twice. More generally, for integers b,n=2b,n\geq 2, let... see more

Let G be a connected graph. If s(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the proximity, p(G), of G is defined as the smallest value of s(v) over al... see more

The main objective of this paper is to present upper bounds for the degree of H-bases of polynomial ideals. For this purpose, we introduce the new concept of  reduced H-bases and show that the maximal degree of the elements of any reduced H-basis of ... see more

Let G = (V,E) be a simple connected graph with the vertex set V = {1,2,...,n} and sequence of vertex degrees (d1,d2,...,dn) where di denotes the degree of a vertex i ? V. With i ~ j, we denote the adjacency of the vertices i and j in the graph G. The... see more

In the military deployment planning problem (DPP), troops and cargoes are transported from source nodes to destination nodes by using multimodal transportation assets, while considering various constraints, such as the supply availability, demand satisfac... 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

The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality b(G) = 2s - 2, provided G has degree s vertices.... see more

1 of 794 pages  |  10  records  |  more records»