Several parameters of generalized Mycielskians
Autor: | Guohua Gu, Peter Che Bor Lam, Jianzhuan Wu, Wensong Lin |
---|---|
Jazyk: | angličtina |
Předmět: |
Discrete mathematics
Domination analysis Applied Mathematics Vertex cover Biclique partition number Vertex cover number Mycielskian Complete bipartite graph Graph Combinatorics Fractional total domination number Circular clique number Partition (number theory) Discrete Mathematics and Combinatorics Generalized Mycielskian Clique number Mathematics |
Zdroj: | Discrete Applied Mathematics. (8):1173-1182 |
ISSN: | 0166-218X |
DOI: | 10.1016/j.dam.2005.11.001 |
Popis: | The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m⩾0, one can transform G into a new graph μm(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μm(G). |
Databáze: | OpenAIRE |
Externí odkaz: |