Results 41 to 50 of about 5,252 (152)

Strong edge coloring for channel assignment in wireless radio networks

, 2006
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links ...
Barrett, C.L., Kumar, V.S.A., Thulasidasan, S, Kumar, VSA, Thite, S., Thulasidasan, S., Istrate, G., Marathe, M.V., Barrett, CL, Istrate, G, Marathe, MV, Thite, SV   +11 more
core   +1 more source

Towards Blue Long-Lasting Luminescence of Eu/Nd-Doped Calcium-Aluminate Nanostructured Platelets via the Molten Salt Route

Nanomaterials, 2019
Calcia-alumina binary compounds doped with rare earths and some transition metals cations show persistent luminescence from the visible to the infrared range.
Rocío E. Rojas-Hernandez, Fernando Rubio-Marcos, Aida Serrano, Eduardo Salas, Irina Hussainova, José Francisco Fernandez   +5 more
doaj   +1 more source

The Strong Chromatic Index of Complete Halin Graphs

Mathematics
The strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G),
Zhiwei Bi, Yunfang Tang
doaj   +1 more source

Strong 3-Rainbow Indexes of Closed Helm Graphs

Indonesian Journal of Combinatorics
Let G be a nontrivial, edge-colored, and connected graph of order m≥3 where adjacent edges may have the same color. A tree T in graph G is called a rainbow tree if all the edges in T have different colors.
Calista Suci Nugrahani, Christian Constantine, A. N. M. Salman   +2 more
doaj   +1 more source

Strong edge-colorings for $$k$$ k -degenerate graphs

Graphs and Combinatorics, 2014
We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $Δ$ is at most $(4k-2)Δ-k(2k-1)+1$.
openaire   +2 more sources

List strong edge coloring of some classes of graphs [PDF]

Australas. J Comb., 2014
7 pages; published ...
Watcharintorn Ruksasakchai, Tao Wang 0005   +1 more
openaire   +2 more sources

Placement Delivery Arrays from Combinations of Strong Edge Colorings [PDF]

2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019
It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, and M. Cheng, {\em IEEE Commun. Lett.}, 22(2):236-239 (2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng, X. Tang, and Q.
Jerod Michel, Qi Wang 0012
openaire   +2 more sources

Strong Rainbow Edge Coloring of Some Interconnection Networks

, 2015
A rainbow edge coloring of a connected graph is a coloring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are colored the same.
Arputhamary, I. Annammal, Mercy, M. Helda   +1 more
core   +1 more source

Rainbow connection number of corona product of graphs

Electronic Journal of Graph Theory and Applications
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj   +1 more source

Strong chromatic index of claw-free graphs with edge weight seven

, 2023
Let $G$ be a graph and $k$ a positive integer. A strong $k$-edge-coloring of $G$ is a mapping $\phi: E(G)\to \{1,2,...,k\}$ such that for any two edges $e$ and $e^'$ that are either adjacent to each other or adjacent to a common edge, $\phi(e)\ne \phi(e^'
Wensong Lin, Lin, Wensong, Yuquan Lin, Lin, Yuquan   +3 more
core   +1 more source