نتایج جستجو برای: labelling of graphs
تعداد نتایج: 21177575 فیلتر نتایج به سال:
Upon publication of the original article [1], the authors noticed that the figure labelling for Fig. 4 in the online version was processed wrong. The top left panel should be panel a, with the panels to its right being b and c. d and e should be the panels on the lower row, and f is correct. The graphs themselves are all correct. It is simply the letter labels that are wrong.
Let j ≥ k ≥ 0 be integers. An `-L(j, k)-labelling of a graph G = (V , E) is a mapping φ : V → {0, 1, 2, . . . , `} such that |φ(u)−φ(v)| ≥ j if u, v are adjacent and |φ(u)−φ(v)| ≥ k if they are distance two apart. Let λj,k(G) be the smallest integer ` such that G admits an `-L(j, k)-labelling. Define λj,k(G) to be the smallest ` if G admits an `-L(j, k)-labelling with φ(V ) = {0, 1, 2, . . . , ...
An efficient model to store and retrieve surface watershed boundaries using graph theoretic approaches is proposed. Our approach utilizes three algorithms and accepts as input standard digital elevation models derived stream catchment boundaries. The first is called Modified Nested Set (MNS), which is a generalized depth first graph traversal algorithm that searches across stream reaches (verti...
We consider two infinite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way infinite path) in G, so that the ray’s labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, prov...
solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent moti...
Given a real-analytic manifold M , a compact connected Lie group G and a principal G-bundle P → M , there is a canonical ‘generalized measure’ on the space A/G of smooth connections on P modulo gauge transformations. This allows one to define a Hilbert space L2(A/G). Here we construct a set of vectors spanning L2(A/G). These vectors are described in terms of ‘spin networks’: graphs φ embedded i...
Labelling problems for graphs consist in building distributed data structures, making it possible to check a given graph property or to compute a given function, the arguments of which are vertices. For an inductively computable function D, if G is a graph with n vertices and of clique-width at most k, where k is fixed, we can associate with each vertex x of G a piece of information (bit sequen...
A mapping from the vertex set of a graph G = (V,E) into an interval of integers {0, . . . , k} is an L(2, 1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common neighbour are mapped onto distinct integers. It is known that for any fixed k ≥ 4, deciding the existence of such a labelling is an NP-complete p...
Huge and expensive computation resources are usually required to perform graph labelling at high speed. This fact restricts an extensive use of this methodology in industrial applications such as visual inspection. A new systolic architecture is presented which computes structural distances between cliques of different graphs based on a modified incremental Levenshtein distance algorithm. The d...
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید