# The complexity of obtaining a distance-balanced graph.

Cabello, Sergio; Lukšič, Primož

The Electronic Journal of Combinatorics [electronic only] (2011)

- Volume: 18, Issue: 1, page Research Paper P49, 10 p., electronic only-Research Paper P49, 10 p., electronic only
- ISSN: 1077-8926

## Access Full Article

top## How to cite

topCabello, Sergio, and Lukšič, Primož. "The complexity of obtaining a distance-balanced graph.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P49, 10 p., electronic only-Research Paper P49, 10 p., electronic only. <http://eudml.org/doc/230327>.

@article{Cabello2011,

author = {Cabello, Sergio, Lukšič, Primož},

journal = {The Electronic Journal of Combinatorics [electronic only]},

keywords = {distance balanced graph; self median graph; sum of distances; distance degree regular; optimization problem},

language = {eng},

number = {1},

pages = {Research Paper P49, 10 p., electronic only-Research Paper P49, 10 p., electronic only},

publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},

title = {The complexity of obtaining a distance-balanced graph.},

url = {http://eudml.org/doc/230327},

volume = {18},

year = {2011},

}

TY - JOUR

AU - Cabello, Sergio

AU - Lukšič, Primož

TI - The complexity of obtaining a distance-balanced graph.

JO - The Electronic Journal of Combinatorics [electronic only]

PY - 2011

PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos

VL - 18

IS - 1

SP - Research Paper P49, 10 p., electronic only

EP - Research Paper P49, 10 p., electronic only

LA - eng

KW - distance balanced graph; self median graph; sum of distances; distance degree regular; optimization problem

UR - http://eudml.org/doc/230327

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.