On the number of genus one labeled circle trees.
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Esselstein, Rachel M., Winkler, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Śniady, Piotr (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mounira Nekri, Abdelhafid Berrachedi (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria...