Words with intervening neighbours in infinite Coxeter groups are reduced.
Eriksson, Henrik, Eriksson, Kimmo (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Conjugacy of Coxeter elements.”
Words with intervening neighbours in infinite Coxeter groups are reduced.
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Super Edge-Antimagic Total Labeling Of Subdivided Stars
Muhammad Javaid (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial sup- port for the correctness of this conjecture by formulating some super (a, d)- edge-antimagic total labelings on a subclass of subdivided stars denoted by T(n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edge- antimagic labeling parameter d, where n ≥ 3 is odd, nm = 2m−4(4n+1)+1, r ≥ 5 and 5 ≤ m ≤ r.
On invertor elements and finitely generated subgroups of groups acting on trees with inversions.
Mahmood, R.M.S., Khanfar, M.I. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On edge detour graphs
A.P. Santhakumaran, S. Athisayanathan (2010)
Discussiones Mathematicae Graph Theory
Similarity:
For two vertices u and v in a graph G = (V,E), the detour distance D(u,v) is the length of a longest u-v path in G. A u-v path of length D(u,v) is called a u-v detour. A set S ⊆V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn₁(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn₁(G) is an edge detour basis of G. A connected graph G is called an edge detour graph if it has...
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Implementation of directed acyclic word graph
Miroslav Balík (2002)
Kybernetika
Similarity:
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i....
Total edge irregularity strength of trees
Jaroslav Ivančo, Stanislav Jendrol' (2006)
Discussiones Mathematicae Graph Theory
Similarity:
A total edge-irregular k-labelling ξ:V(G)∪ E(G) → {1,2,...,k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which a graph G has a total edge-irregular k-labelling is called the total edge irregularity strength of G, tes(G). In this paper we prove that...