Results 21 to 30 of about 2,257,273 (319)
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Mathematics, 2022 Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
Statistical localization: From strong fragmentation to strong edge modes
Physical Review B, 2020 Certain disorder-free Hamiltonians can be non-ergodic due to a \emph{strong fragmentation} of the Hilbert space into disconnected sectors. Here, we characterize such systems by introducing the notion of `statistically localized integrals of motion' (SLIOM), whose eigenvalues label the connected components of the Hilbert space.
Rakovszky, Tibor +4 more
openaire +4 more sources
Strong Edge-Coloring of Hamming Graphs
Proceedings of Computer Science and Information Technologies 2023 Conference, 2023 An edge coloring of a graph G is a mapping Á : EG ! N. The edge coloring Á is called strong if Áe 6= Áe0 for any two edges e and e0 that are distance at most one apart. The minimum number of colors needed for a strong edge coloring of a graph G is called strong chromatic index of G and denoted by Â0 sG.
Drambyan, A., Petrosyan, P.
openaire +2 more sources
Transport in the tokamak - reactor edge plasma with strong collisionality
Nuclear Materials and Energy, 2022 In detached divertor regimes, especially in future tokamak-reactors, plasma in the divertor is strongly collisional. When ion-ion and ion-neutral collision frequencies become comparable with the ion gyrofrequency, plasma transport is strongly affected by
V. Rozhansky +3 more
doaj +1 more source
Strong Edge Coloring of Generalized Petersen Graphs
Mathematics, 2020 A strong edge coloring of a graph G is a proper edge coloring such that every color class is an induced matching. In 2018, Yang and Wu proposed a conjecture that every generalized Petersen graph P(n,k) with k≥4 and n>2k can be strong edge colored with ...
Ming Chen, Lianying Miao, Shan Zhou
doaj +1 more source
LA-ShuffleNet: A Strong Convolutional Neural Network for Edge Computing Devices
IEEE Access, 2023 ShuffleNetV2 is a prominent player in the field of lightweight networks and has significant implications for the development of lightweight networks and edge computing.
Hui Zhang +4 more
doaj +1 more source
The strong 3-rainbow index of some certain graphs and its amalgamation [PDF]
Opuscula Mathematica, 2022 We introduce a strong \(k\)-rainbow index of graphs as modification of well-known \(k\)-rainbow index of graphs. A tree in an edge-colored connected graph \(G\), where adjacent edge may be colored the same, is a rainbow tree if all of its edges have ...
Zata Yumni Awanis, A.N.M. Salman
doaj +1 more source
Between Proper and Strong Edge-Colorings of Subcubic Graphs [PDF]
Combinatorial Algorithms31st International Workshop, 2020 AbstractIn a proper edge‐coloring the edges of every color form a matching. A matching is induced if the end‐vertices of its edges induce a matching. A strong edge‐coloring is an edge‐coloring in which the edges of every color form an induced matching.
Hocquard H, Lajou D, Lužar B.
europepmc +4 more sources
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
Journal of Mathematics, 2021 Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +1 more source