Results 1 to 10 of about 8,817,262 (352)
On the problem of cyclization of “Little Tragedies” by A. S. Pushkin [PDF]
The article proposes a new version of the cycle-forming organization of “Little Tragedies” by A. S. Pushkin, after a brief excursion through the already existing cycle-forming concepts of a group of scenes and plays united in Russian culture under the ...
Zakharov, Kirill Mikhailovich
doaj +1 more source
On The Investigating Cycle Properties In The Galilean Plane G^2
The introduction of the Galilean plane within the affine plane parallels the familiar concepts of the Euclidean plane, extending the realm of geometric exploration.
Abdullah Kurudirek
doaj +1 more source
THE STUDY OF ECCENTRICITY SPECTRUM AND ENERGY IN PATH AND CYCLE GRAPHS
The eccentricity matrix is one of matrices to represent graphs. The eccentricity matrix is used as a basis for calculating the eccentricity spectrum and energy. This article aims to study the concepts of eccentricity spectrum and energy in simple graphs.
Ni Kadek Emik Sapitri +1 more
doaj +1 more source
Cycles intersecting edge-cuts of prescribed sizes [PDF]
We prove that every cubic bridgeless graph $G$ contains a $2$-factor which intersects all (minimal) edge-cuts of size $3$ or $4$. This generalizes an earlier result of the authors, namely that such a $2$-factor exists provided that $G$ is planar.
Tomáš Kaiser, Riste Škrekovski
doaj +1 more source
Several zones in southwestern Morocco were surveyed following a recent exceptional invasion of a species of cicada in May 2021, which caused significant damage, particularly in young almond plantations. The objective is to identify the cicada causing the
Yamna Ouguas +5 more
doaj +1 more source
The Modular Irregularity Strength of C_n⊙mK_1
Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α ...
Putu Kartika Dewi
doaj +1 more source
AVD proper edge-coloring of some families of graphs
Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Life cycle analysis of road construction and use [PDF]
Both the construction and use of roads have a range of environmental impacts; therefore, it is important to assess the sources of their burdens to adopt correct mitigation policies.
D'Andrea, Antonio +2 more
core +1 more source
Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable
In simple graphs, DP-coloring is a generalization of list coloring and thus many results of DP-coloring generalize those of list coloring. Xu and Wu proved that every planar graph without 5-cycles adjacent simultaneously to 3-cycles and 4-cycles is 4 ...
Kittikorn Nakprasit +2 more
doaj +1 more source
Purpose. Most of the freight traffic in Ukraine is made by railway transport. Government statistics of annual railway freight traffic (January-November) records the following data: 2011 - 468 million tons (108.2% to 2010); 2012 – 421.5 million tons (98.
А. R. Мilianych
doaj +1 more source

