Temat: Johnson graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Regularity and Planarity of Token Graphs
Autorzy:: Carballosa, Walter
Fabila-Monroy, Ruy
Leaños, Jesús
Rivera, Luis Manuel
Powiązania:: https://bibliotekanauki.pl/articles/31341726.pdf
Data publikacji:: 2017-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: token graph
Johnson graph
regularity
planarity
Opis:: Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 3; 573-586
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: The competition numbers of Johnson graphs
Autorzy:: Kim, Suh-Ryung
Park, Boram
Sano, Yoshio
Powiązania:: https://bibliotekanauki.pl/articles/744040.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: competition graph
competition number
edge clique cover
Johnson graph
Opis:: The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and to characterize all graphs with given competition number k has been one of the important research problems in the study of competition graphs.
The Johnson graph J(n,d) has the vertex set ${v_X | X ∈ \binom{[n]}{d}$, where $\binom{[n]}{d}$ denotes the set of all d-subsets of an n-set [n] = {1,..., n}, and two vertices $v_{X₁}$ and $v_{X₂}$ are adjacent if and only if |X₁ ∩ X₂| = d - 1. In this paper, we study the edge clique number and the competition number of J(n,d). Especially we give the exact competition numbers of J(n,2) and J(n,3).
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 3; 449-459
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Johnson graph" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język