RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Subscription Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Diskretn. Anal. Issled. Oper.: Year: Volume: Issue: Page: Find

 Diskretn. Anal. Issled. Oper., Ser. 1, 2001, Volume 8, Number 3, Pages 73–80 (Mi da226)

On the isometric embedding of arbitrary graphs into a graph of a given diameter possessing the metric continuation property

V. A. Tashkinov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: We prove that an arbitrary ordinary graph $G$ can be embedded as a generated subgraph into a graph $H$ of given diameter $d(H)=d\geqslant 2$ in which any two vertices lie on some diametral path. If the diameter $d(G)$ of $G$ is less than or equal to $d$, then the embedding can be achieved isometrically, that is, with preservation of the distances between the vertices in $G$.

Full text: PDF file (835 kB)

Bibliographic databases:
UDC: 519.176

Citation: V. A. Tashkinov, “On the isometric embedding of arbitrary graphs into a graph of a given diameter possessing the metric continuation property”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 73–80

Citation in format AMSBIB
\Bibitem{Tas01} \by V.~A.~Tashkinov \paper On the isometric embedding of arbitrary graphs into a~graph of a~given diameter possessing the metric continuation property \jour Diskretn. Anal. Issled. Oper., Ser.~1 \yr 2001 \vol 8 \issue 3 \pages 73--80 \mathnet{http://mi.mathnet.ru/da226} \mathscinet{http://www.ams.org/mathscinet-getitem?mr=1859852} \zmath{https://zbmath.org/?q=an:0977.05037}