All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

N(2)-locally disconnected graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F93%3A00000549" target="_blank" >RIV/49777513:23520/93:00000549 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    N(2)-locally disconnected graphs

  • Original language description

    A graph is N(2)-locally disconnected if the second-type neighborhood of every its vertex is disconnected. In the paper we study the maximum size of an N(2)-locally disconnected graph of given order.

  • Czech name

    N(2)-lokálně nesouvislé grafy

  • Czech description

    Graf je N(2)-lokálně nesouvislý jestliže okolí 2. druhu každého uzlu je nesouvislé. V článku je studován maximální možný počet hran N(2)-lokálně nesouvislého grafu s daným počtem uzlů.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    1993

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Discrete Mathematics

  • ISSN

    0012-365X

  • e-ISSN

  • Volume of the periodical

  • Issue of the periodical within the volume

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    6

  • Pages from-to

    189

  • UT code for WoS article

  • EID of the result in the Scopus database