# A remark on graph operators

Mathematica Bohemica (1999)

- Volume: 124, Issue: 1, page 83-85
- ISSN: 0862-7959

## Access Full Article

top## Abstract

top## How to cite

topZelinka, Bohdan. "A remark on graph operators." Mathematica Bohemica 124.1 (1999): 83-85. <http://eudml.org/doc/248468>.

@article{Zelinka1999,

abstract = {A theorem is proved which implies affirmative answers to the problems of E. Prisner. One problem is whether there are cycles of the line graph operator $L$ with period other than 1, the other whether there are cycles of the 4-edge graph operator $\nabla _4$ with period greater than 2. Then a similar theorem follows.},

author = {Zelinka, Bohdan},

journal = {Mathematica Bohemica},

keywords = {graph operator; line graph; $k$-edge graph; graph operator; line graph; -edge graph},

language = {eng},

number = {1},

pages = {83-85},

publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},

title = {A remark on graph operators},

url = {http://eudml.org/doc/248468},

volume = {124},

year = {1999},

}

TY - JOUR

AU - Zelinka, Bohdan

TI - A remark on graph operators

JO - Mathematica Bohemica

PY - 1999

PB - Institute of Mathematics, Academy of Sciences of the Czech Republic

VL - 124

IS - 1

SP - 83

EP - 85

AB - A theorem is proved which implies affirmative answers to the problems of E. Prisner. One problem is whether there are cycles of the line graph operator $L$ with period other than 1, the other whether there are cycles of the 4-edge graph operator $\nabla _4$ with period greater than 2. Then a similar theorem follows.

LA - eng

KW - graph operator; line graph; $k$-edge graph; graph operator; line graph; -edge graph

UR - http://eudml.org/doc/248468

ER -

## References

top- Prisner E., Graph Dynamics, Longman House Ltd., Burnt Mill, Harlow, Essex 1995. (1995) Zbl0848.05001MR1379114

## Citations in EuDML Documents

top## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.