Distance-locally disconnected graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43917799" target="_blank" >RIV/49777513:23520/13:43917799 - isvavai.cz</a>

Result on the web

<a href="http://www.discuss.wmie.uz.zgora.pl/gt/" target="_blank" >http://www.discuss.wmie.uz.zgora.pl/gt/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.7151/dmgt.1657" target="_blank" >10.7151/dmgt.1657</a>

Result language

angličtina

Original language name

Distance-locally disconnected graphs

Original language description

For a positive integer k, we say that a (finite simple undirected) graph G is k-locally disconnected if, for any vertex x, the set of vertices at distance at most k from x induces in G a disconnected graph. In the paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

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

Name of the periodical

Discussiones Mathematicae Graph Theory

ISSN

1234-3099

e-ISSN

—

Volume of the periodical

33

Issue of the periodical within the volume

1

Country of publishing house

PL - POLAND

Number of pages

13

Pages from-to

"203?215"

UT code for WoS article

—

EID of the result in the Scopus database

—