Results 21 to 30 of about 2,243,492 (285)
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
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
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
Strong edge coloring sparse graphs [PDF]
Electronic Notes in Discrete Mathematics, 2015 A strong edge coloring of a graph is a proper edge coloring such that no edge has two incident edges of the same color. Erdős and Nesetřil conjectured in 1989 that $5 /4∆2$ colors are always enough for a strong edge coloring, where $∆$ is the maximum degree of the graph.
Julien Bensmail +2 more
openaire +1 more source
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
Strong edge-colouring of sparse planar graphs [PDF]
, 2014 A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree $\Delta$ has a strong edge-colouring with at most $4\Delta+4$ colours. We show that $3\Delta+
Bensmail, Julien +3 more
core +5 more sources
r-Strong edge colorings of graphs
Discrete Mathematics, 2006 If \(G\) is a graph and \(n\) a natural number, \(\chi(G,n)\) denotes the minimum number of colours required for a proper edge colouring of \(G\) in which no two vertices with distance at most \(n\) are incident to edges coloured with the same set of colours.
Akbari, S., Bidkhori, H., Nosrati, N.
openaire +2 more sources
Arsenene nanoribbon edge-resolved strong magnetism
Physical Chemistry Chemical Physics, 2018 Edge-resolved strong magnetism in arsenene nanoribbon is attributed to electron entrapment induced by edge bond contraction and potential deepening.
Sanmei Wang +3 more
openaire +3 more sources