Geodesic
On T-irreducible extensions of starlike trees
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 85-86.

Voir la notice de l'article provenant de la source Math-Net.Ru

T-irreducible extension is a kind of the optimal extension of a graph. In the paper, all nonisomorphic T-irreducible extensions are constructed for starlike trees with paths of one and the same length.
Keywords: graph, T-irreducible extension, starlike trees. 
@article{PDMA_2013_6_a40,
     author = {D. U. Osipov},
     title = {On {T-irreducible} extensions of starlike trees},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {85--86},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a40/}
}
TY  - JOUR
AU  - D. U. Osipov
TI  - On T-irreducible extensions of starlike trees
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 85
EP  - 86
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a40/
LA  - ru
ID  - PDMA_2013_6_a40
ER  - 
%0 Journal Article
%A D. U. Osipov
%T On T-irreducible extensions of starlike trees
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 85-86
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a40/
%G ru
%F PDMA_2013_6_a40
D. U. Osipov. On T-irreducible extensions of starlike trees. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 85-86. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a40/

[1] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Nauka, M., 2009

[2] Abrosimov M. B., “Minimalnye rasshireniya ob'edineniya nekotorykh grafov”, Teoreticheskie problemy informatiki i ee prilozhenii, 2001, no. 4, 3–11

[3] Salii V. N., “Dokazatelstva s nulevym razglasheniem v zadachakh o rasshireniyakh grafov”, Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie, 2003, no. 6, 63–65 | MR

[4] Kurnosova S. G., “T-neprivodimye rasshireniya dlya nekotorykh klassov grafov”, Teoreticheskie problemy informatiki i ee prilozhenii, 2004, no. 6, 113–125