A note on polynomials and -factors of graphs.
Shirazi, Hamed, Verstraëte, Jacques (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Quantum field theory over .”
A note on polynomials and -factors of graphs.
On magic and supermagic line graphs
Jaroslav Ivančo, Z. Lastivková, A. Semaničová (2004)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
A multivariate interlace polynomial and its computation for graphs of bounded clique-width.
Courcelle, Bruno (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Operations on well-covered graphs and the Roller-Coaster conjecture.
Matchett, Philip (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounded-degree graphs can have arbitrarily large slope numbers.
Pach, János, Pálvölgyi, Dömötör (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: