Results 121 to 130 of about 3,558 (256)
Fault Detection of Electric Motors via Symmetrized Dot Pattern‐Based Features
ABSTRACT This study proposes a novel symmetrized dot pattern (SDP) approach using designed SDP‐based features, extracted from transformed vibration signals, for fault detection. These features describe the compactness, inclination, and shape of the “snowflake” diagram distributions.
Mario Spirto +6 more
wiley +1 more source
ABSTRACT In response to the increasing volume of parcels, last‐mile delivery innovations are exploring the integration of multiple delivery modes. The most prominent examples are delivery vans that, next to being the base for the delivery tasks of their human drivers, also function as mobile launching platforms for drones or autonomous delivery robots.
Nils Boysen +2 more
wiley +1 more source
The irregularity of graphs under graph operations
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
A Class of Graphs Approaching Vizing's Conjecture
For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Aziz Contractor, Elliot Krop
doaj +1 more source
On $H$-antimagicness of Cartesian product of graphs
Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin +3 more
openaire +2 more sources
NowPrecip 2: Precipitation nowcasting in the complex terrain of Switzerland. Part I: Methods
In this work we present the methods of the areal precipitation nowcasting system NowPrecip version 2. In this version a new methodology is introduced, which, although it shares philosophy and techniques with the original methodology of NowPrecip version 1, can be considered as distinct from that.
I. V. Sideris +7 more
wiley +1 more source
Monotone Chromatic Number of Graphs
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
Edge-Transitive Lexicographic and Cartesian Products
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
On perfect codes in Cartesian products of graphs
Assuming the existence of a partition in perfect codes of the vertex set of a finite or infinite bipartite graph $G$ we give the construction of a perfect code in the Cartesian product $ G \Box G \Box P_2$. Such a partition is easily obtained in the case of perfect codes in Abelian Cayley graphs and we give some example of applications of this result ...
openaire +2 more sources
NowPrecip 2: Precipitation nowcasting in the complex terrain of Switzerland. Part II: Verification
In this work we present the verification of the NowPrecip precipitation nowcasting systems (version 1 and version 2). Using 3.5 years of data over the period 2020–2023, their performance is compared with PySTEPS and the ICON numerical weather prediction ensemble by computing deterministic and probabilistic metrics.
A. Ntoumos +8 more
wiley +1 more source

