Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421026 | Discrete Applied Mathematics | 2006 | 10 Pages |
Abstract
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⩾0m⩾0, one can transform G into a new graph μm(G)μ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)μm(G).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu,