Results 41 to 50 of about 745,346 (269)
Multimodal ecoinformation analysis as an modern computative approach to geospatial investigation of biodiversity structure is performed on maximum entropy method for local populations of Iris glaucescens -rare species of vascular plants that is included ...
Baikov Konstantin, Doronkin Vladimir
doaj +1 more source
Equitable colourings of Borel graphs
Hajnal and Szemerédi proved that if G is a finite graph with maximum degree $\Delta $ , then for every integer $k \geq \Delta +1$ , G has a proper colouring with k colours in which every two colour classes differ in size at most by $1$ ;
Anton Bernshteyn, Clinton T. Conley
doaj +1 more source
An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (i) v = u, (ii) e = f, or (iii) edge vu is from the set {e, f}.
Kardoš František +4 more
doaj +1 more source
On the average eccentricity, the harmonic index and the largest signless Laplacian eigenvalue of a graph [PDF]
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $eccleft(Gright)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The harmonic index $Hleft(Gright)$ of a graph
Hanyuan Deng +3 more
doaj +1 more source
On the average degree of critical graphs with maximum degree six
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miao, Lianying, Qu, Jibin, Sun, Qingbo
openaire +1 more source
Numerical Simulation of Mechanical Properties of Soil Considering the Effect of Internal Erosion
The loss of fine particles from the skeleton formed by coarse particles due to seepage action significantly affects the grading, void ratio, and mechanical properties of soil. This results in several issues of engineering hazards. In order to analyze the
Mao-Wen Li, Sheng-Liang Hu, Chen-Xi Tong
doaj +1 more source
Generation, Ranking and Unranking of Ordered Trees with Degree Bounds [PDF]
We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of Δ. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in which no node has degree
Mahdi Amani, Abbas Nowzari-Dalini
doaj +1 more source
A method for evaluating the entanglement efficiency of dual-path entangled microwaves based on second-order correlation detection is proposed in this paper.
Tianli Wei +5 more
doaj +1 more source
On weight choosabilities of graphs with bounded maximum average degree
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Przybyło, Jakub +2 more
openaire +1 more source
MODELS FOR DETERMINING MAXIMUM DEGREE FILLING CHANNELS OF CIRCULAR SECTION SHAPE
Objectives The task was to obtain a model for determining the maximum possible degree of filling the circular section channels in the earthen channel based on the condition of ensuring the stability of slopes and the minimum volume of excavation during ...
A. K. Alibekov, G. A. Аlibekov
doaj +1 more source

