Document Zbl 1050.05108

Structured Search

Help

Examples

Geometry Search for the term Geometry in any field. Queries are case-independent.

Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.

"Topological group" Phrases (multi-words) should be set in "straight quotation marks".

au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.

Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.

Quasi* map* py: 1989 The resulting documents have publication year 1989.

so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.

"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.

dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.

py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).

la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Fields

any	anywhere
an	internal document identifier
au	author, editor
ai	internal author identifier
ti	title
la	language
so	source
ab	review, abstract
py	publication year
rv	reviewer
cc	MSC code
ut	uncontrolled term
dt	document type (j: journal article; b: book; a: book article)

Operators

a & b	logic and
a \| b	logic or
!ab	logic not
abc*	right wildcard
"ab c"	phrase
(ab c)	parentheses

Ivančo, J.; Lastivková, Z.; Semaničová, A.

On magic and supermagic line graphs. (English) Zbl 1050.05108

Math. Bohem. 129, No. 1, 33-42 (2004).

Summary: 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.

Cited in 2 Documents

MSC:

05C78	Graph labelling (graceful graphs, bandwidth, etc.)
05C75	Structural characterization of families of graphs

Keywords:

magic graphs; supermagic graphs; line graphs

PDF BibTeX XML Cite