Results 41 to 50 of about 5,380,347 (268)
Vertex degrees close to the average degree
Discrete Mathematics, 2023 Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular, for $d_+\in \left(\sqrt{dn},n-1\right]$, we show the existence of a vertex in $G$ of degree between $d_+-\left ...
Johannes Pardey, Dieter Rautenbach
openaire +3 more sources
L’expression de l’intensité par la conséquence ou la cause
Corela, 2005 Giving a consequence or a cause in addition to a fact, or even instead of it, in order to express its intensity, is a very widespread rhetorical device in French. In this article, we will first examine the two types of inferences such a device builds on,
Clara Romero
doaj +1 more source
Teacher training of Kindergarden and Primary Education in the EEES framework
Revista de Estudios e Investigación en Psicología y Educación, 2015 Updating of the educational methodology to build the European Higher Education Area stands as a key goal to the Spanish universities. In the case of primary and kindergarten teacher training was necessary to design qualifications as the teacher's ...
Julio Antonio González-Pienda +4 more
doaj +1 more source
, 2016 (A and B) Histograms across recordings of correlations between synergy (computation) and receiver in-degree (A) and between synergy (computation) and transmitter out-degree (B) (Ndata = 40). Also shown is the skew towards positive or negative correlation
Masanori Shimono (533462) +8 more
core +1 more source
On the Degree-Based Topological Indices of the Tickysim SpiNNaker Model
Axioms, 2018 Tickysim is a clock tick-based simulator for the inter-chip interconnection network of the SpiNNaker architecture. Network devices such as arbiters, routers, and packet generators store, read, and write forward data through fixed-length FIFO buffers.
Muhammad Imran +4 more
doaj +1 more source
Degree-constrained graph partition
, 2019 In this paper, we consider the task of partitioning a given graph intwo two non-empty subgraphs such that one of them has no vertex of degree less than 2, the other has no vertex of degree less than 3.
Thinh D. Nguyen (6385907)
core +1 more source
Optimization of the Municipal Waste Collection Route Based on the Method of the Minimum Pairing
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 2016 In the present article is shown the use of Maple program for processing of data describing the position of municipal waste sources and topology of collecting area.
Michal Petřík, Stanislav Bartoň
doaj +1 more source
ISI(G) Topological Index of Sum Graphs For Some Finite Groups
Academic Science Journal, 2023 A topological index can capture much information about a mathematical structure into an actual number. The topological indices have an essential role in theoretical mathematics.
mahera rabee
doaj +1 more source
kisonecat/find-degree: clean version
, 2019 compute the degree of explicit maps between ...
Jim Fowler
core +1 more source
Measuring degree-degree association in networks [PDF]
Physical Review E, 2010 The Pearson correlation coefficient is commonly used for quantifying the global level of degree-degree association in complex networks. Here, we use a probabilistic representation of the underlying network structure for assessing the applicability of different association measures to heavy-tailed degree distributions.
Raschke M, Schläpfer M, Nibali R
openaire +4 more sources