Results 11 to 20 of about 2,257,273 (319)
Strong edge features for image coding [PDF]
, 1996 A two-component model is proposed for perceptual image coding. For the first component of the model, the watershed operator is used to detect strong edge features.
Casas Pla, Josep Ramon +1 more
core +3 more sources
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +3 more sources
Strong edge-colorings for k-degenerate graphs [PDF]
Graphs and Combinatorics, 2013 We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $\Delta$ is at most $(4k-2)\Delta-k(2k-1)+1$
Yu, Gexin
core +2 more sources
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +5 more sources
Strong Edge Cover of the Graph
International Journal of Scientific and Innovative Mathematical Research, 2017 D. K. Thakkar +9 more
openalex +2 more sources
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning [PDF]
Neutrosophic Sets and Systems, 2020 In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next,
Masoud Ghods, Zahra Rostami
doaj +1 more source
Ratio Mathematica, 2023 Let G=(V,\ E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set of G if │Ns[e] S│ = 1 for all e E(G)(│Nw[e] S│ = 1 for all e E(G)) where Ns(e) ={f / f E(G), f is adjacent to e & deg f ≥ deg e}(Nw(e) ={f / f
M Annapoopathi, N Meena
doaj +1 more source
From Edge-Coloring to Strong Edge-Coloring [PDF]
The Electronic Journal of Combinatorics, 2015 In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin +6 more
openaire +3 more sources
Tunneling edges at strong disorder [PDF]
Physical Review B, 1995 RevTeX, 4 ...
Miller, Jonathan, Rojo, A. G.
openaire +3 more sources
Strong Edge Coloring of K4(t)-Minor Free Graphs
Axioms, 2023 A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Huixin Yin, Miaomiao Han, Murong Xu
doaj +1 more source