Institute of Informatics
Acta Cybernetica
Past Issues
Volume 2, Number 4, 1976
Short-circuited k-trees
# Short-circuited k-trees

**I. Pávó**

### Abstract (in LaTeX format)

In this paper the author introduces the idea of the short-circuited k-tree arising from k-tree of a graph in each component of which a vertex is given in advance. Necessary and sufficient condition is given for short-circuited k-trees to be circuitless and a procedure to generate is shown, too. During this procedure the generation of k-trees published by the author in an earlyer paper [6] is used as well. The authors methods can be applied in designing of general linear electrical networks by topological formulas.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Pavo:1976:ActaCybernetica,`

author = {I. P{\'a}v{\'o}},

title = {Short-circuited k-trees},

journal = {Acta Cybernetica},

year = {1976},

volume = {2},

pages = {323--333},

number = {4},

abstract = {In this paper the author introduces the idea of the short-circuited k-tree arising from k-tree of a graph in each component of which a vertex is given in advance. Necessary and sufficient condition is given for short-circuited k-trees to be circuitless and a procedure to generate is shown, too. During this procedure the generation of k-trees published by the author in an earlyer paper [6] is used as well. The authors methods can be applied in designing of general linear electrical networks by topological formulas.}

}