نتایج جستجو برای: distinct edge geodetic decomposition number

تعداد نتایج: 1569300  

1997
Lars Floreby Farook Sattar Göran Salomonsson

An algorithm for multiresolution pyramid decomposition is described. At each stage, the smoothed (“lowpass”) image is obtained by combining morphological grayscale opening and closing. Using this technique, we avoid the systematic bias of traditional approaches, as illustrated by an example. As our application, we perform image enhancement by modifying the reconstruction scheme using a morpholo...

Journal: :Graphs and Combinatorics 2015

Journal: :Physical Review B 2016

2006
Hamed Hatami

An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree ∆ and with no isolated edges has an avd-coloring with at most ∆ + 300 colors, provided that ∆ > 1020. AMS Subject Classification: 05C15

Journal: :Discrete Mathematics 2008
Linda Eroh Ortrud R. Oellermann

Let G be a connected graph and S ⊆ V (G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices in a graph, denoted by I (S) is the union of all vertices that belong to some Steiner tree for S. If S = {u, v}, then ...

2004
Changhong Lu

For any two vertices u and v in a graph G (digraph D, respectively), a u − v geodesic is a shortest path between u and v (from u to v, respectively). Let I(u, v) denote the set of all vertices lying on a u− v geodesic. For a vertex subset S, let I(S) denote the union of all I(u, v) for u, v ∈ S. The geodetic number g(G) (g(D), respectively) of a graph G (digraph D, respectively) is the minimum ...

2017
Ehsan Forootan Jürgen Kusche Matthieu Talpe C. K. Shum Michael Schmidt

In recent decades, decomposition techniques have enabled increasingly more applications for dimension reduction, as well as extraction of additional information from geophysical time series. Traditionally, the principal component analysis (PCA)/empirical orthogonal function (EOF) method and more recently the independent component analysis (ICA) have been applied to extract, statistical orthogon...

1980
C. Douglas C. C. Goad F. F. Morrison

the basic National horizontal and vertical networks of geodetic control and provides governmentwide leadership in the improvement of geodetic surveying methods and instrumentation, coordinates operations to assure network development, and provides specifications and criteria for survey operations by Federal, State, and other agencies. NGS engages in research and development for the improvement ...

Journal: :mathematics interdisciplinary research 0
morteza faghani payame noor university ehsan pourhadi iran university of science and technology

this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct in nite families of fullerenes generated by the o ered process.

2003
D. S. MacMillan

In our standard geodetic VLBI solutions, we estimate the positions of quasars assuming that their positions do not vary in time. However, in solutions estimating proper motion, a significant number of quasars show apparent proper motion greater than 50 μas/yr. For individual quasars, there are source structure effects that cause apparent proper motion. To examine how coherent the pattern of app...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید