Goal-minimally $k$-elongated graphs

In: Mathematica Slovaca, vol. 59, no. 2

Štefan Gyürki

Detaily:

Rok, strany: 2009, 193 - 200

Kľúčové slová:

distance, diameter, edge deletion, goal-minimal

DOI: https://doi.org/10.2478/s12175-009-0117-4

O článku:

Let $k$ be an integer. A 2-edge connected graph $G$ is said to be goal-minimally $k$-elongated (\mbox{$k$-GME}) if for every edge $uv\in E(G)$ the inequality $d_G-uv(x,y)>k$ holds if and only if $\{u,v\} = \{x,y\}$. In particular, if the integer $k$ is equal to the diameter of graph $G$, we get the goal-minimally $k$-diametric (\mbox{$k$-GMD}) graphs. In this paper we construct some infinite families of GME graphs and explore $k$-GME and $k$-GMD properties of cages.

Ako citovať:

ISO 690:

Gyürki, Š. 2009. Goal-minimally $k$-elongated graphs. In Mathematica Slovaca, vol. 59, no.2, pp. 193-200. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0117-4

APA:

Gyürki, Š. (2009). Goal-minimally $k$-elongated graphs. Mathematica Slovaca, 59(2), 193-200. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0117-4

O vydaní: