Factorizations of complete graphs into [n,r,s,2]-caterpillars with maximum center

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010916" target="_blank" >RIV/61989100:27240/04:00010916 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Factorizations of complete graphs into [n,r,s,2]-caterpillars with maximum center
Original language description
A tree $R$ such that after deleting all leaves we obtain a path $P$ is called a {it caterpillar}. The path $P$ is called the {it spine} of the caterpillar $R$. If the spine has length 3 and $R$ on $2n$ vertices contains vertices of degrees $n,r,s,2$, where $r,s>2$, and if a vertex of degree $n$ is an internal vertex of the spine then we say that $R$ is an {it $[n,r,s,2]$-caterpillar with maximum center} of diameter 5. We completely characterize $[2k+1,r,s,2]$-caterpillars of order $4k+2$ and diameter 5with maximum center that factorize the complete graph $K_{4k+2}$.
Czech name
Factorizations of complete graphs into [n,r,s,2]-caterpillars with maximum center
Czech description
A tree $R$ such that after deleting all leaves we obtain a path $P$ is called a {it caterpillar}. The path $P$ is called the {it spine} of the caterpillar $R$. If the spine has length 3 and $R$ on $2n$ vertices contains vertices of degrees $n,r,s,2$, where $r,s>2$, and if a vertex of degree $n$ is an internal vertex of the spine then we say that $R$ is an {it $[n,r,s,2]$-caterpillar with maximum center} of diameter 5. We completely characterize $[2k+1,r,s,2]$-caterpillars of order $4k+2$ and diameter 5with maximum center that factorize the complete graph $K_{4k+2}$.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)