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
Study on Screening Criteria of Gel-Assisted Polymer and Surfactant Binary Combination Flooding after Water Flooding in Strong Edge Water Reservoirs: A Case of Jidong Oilfield [PDF]
Gels, 2022 Strong edge water reservoirs have sufficient natural energy. After long-term natural water flooding development, it is in the stage of ultrahigh water cut. There is an urgent need to change the development mode and improve the development effect.
Fuquan Luo +4 more
doaj +2 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
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
An investigation of strong edge geodesic number on m-polar fuzzy environment and its application. [PDF]
PLoS ONEFor crisp graphs, the notion of edge geodesic numbers has been known for a long time. But lately, the focus has shifted to investigating this idea in fuzzy graphs, which has resulted in studies of a number of properties.
Tanmoy Mahapatra +2 more
doaj +2 more sources
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
Strong edge geodetic problem in networks
Open Mathematics, 2017 Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul +4 more
doaj +3 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
Edge Fault-Tolerant Strong Menger Edge Connectivity of Folded Crossed Cubes
AxiomsA graph is called strongly Menger-edge connected (SME-connected) if any two vertices are connected by as many edge-disjoint paths as their smaller degree.
Huanshen Jia, Jianguo Qian
doaj +2 more sources
Novel Concept of Interval-Valued Neutrosophic Incidence Graphs with Application [PDF]
Neutrosophic Sets and Systems, 2021 : Neutrosophic set (NS) is a framework used when the imprecision and uncertainty of an event are described based on three possible aspects, i.e., the membership degree, neutral membership degree and non-membership degree.
Siti Nurul Fitriah Mohamad +4 more
doaj +1 more source