- Tytuł:
- Generalized matrix graphs and completely independent critical cliques in any dimension
- Autorzy:
-
Lattanzio, John
Zheng, Quan - Powiązania:
- https://bibliotekanauki.pl/articles/743260.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
matrix graph
chromatic number
critical clique
completely independent critical cliques
double-critical conjecture - Opis:
- For natural numbers k and n, where 2 ≤ k ≤ n, the vertices of a graph are labeled using the elements of the k-fold Cartesian product Iₙ × Iₙ × ... × Iₙ. Two particular graph constructions will be given and the graphs so constructed are called generalized matrix graphs. Properties of generalized matrix graphs are determined and their application to completely independent critical cliques is investigated. It is shown that there exists a vertex critical graph which admits a family of k completely independent critical cliques for any k, where k ≥ 2. Some attention is given to this application and its relationship with the double-critical conjecture that the only vertex double-critical graph is the complete graph.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 583-602
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł