Geodesic
Steiner Distance in Product Networks
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers with $2\leq k\leq n$. Then the \emph{Steiner $k$-eccentricity $e_k(v)$} of a vertex $v$ of $G$ is defined by $e_k(v)=\max \{d_G(S)\,|\,S\subseteq V(G), \ |S|=k, \ and \ v\in S\}$. Furthermore, the \emph{Steiner $k$-diameter} of $G$ is $sdiam_k(G)=\max \{e_k(v)\,|\, v\in V(G)\}$. In this paper, we investigate the Steiner distance and Steiner $k$-diameter of Cartesian and lexicographical product graphs. Also, we study the Steiner $k$-diameter of some networks. 
@article{DMTCS_2018_20_2_a7,
     author = {Mao, Yaping and Cheng, Eddie and Wang, Zhao},
     title = {Steiner {Distance} in {Product} {Networks}},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2018},
     volume = {20},
     number = {2},
     doi = {10.23638/DMTCS-20-2-8},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-8/}
}
TY  - JOUR
AU  - Mao, Yaping
AU  - Cheng, Eddie
AU  - Wang, Zhao
TI  - Steiner Distance in Product Networks
JO  - Discrete mathematics & theoretical computer science
PY  - 2018
VL  - 20
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-8/
DO  - 10.23638/DMTCS-20-2-8
LA  - en
ID  - DMTCS_2018_20_2_a7
ER  - 
%0 Journal Article
%A Mao, Yaping
%A Cheng, Eddie
%A Wang, Zhao
%T Steiner Distance in Product Networks
%J Discrete mathematics & theoretical computer science
%D 2018
%V 20
%N 2
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-8/
%R 10.23638/DMTCS-20-2-8
%G en
%F DMTCS_2018_20_2_a7
Mao, Yaping; Cheng, Eddie; Wang, Zhao. Steiner Distance in Product Networks. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2. doi: 10.23638/DMTCS-20-2-8

Cité par Sources :