Large set of P3‐decompositions
Work
Year: 2002
Type: article
Abstract: Let G =( V ( G ), E ( G )) be a graph. A ( n , G , λ)‐ GD is a partition of the edges of λ K n into subgraphs ( G ‐blocks), each of which is isomorphic to G . The ( n , G ,λ)‐ GD is named as graph de... more
Source: Journal of Combinatorial Designs
Authors Qingde Kang, Yànfāng Zhāng
Institution Hebei Normal University
Cites: 6
Cited by: 3
Related to: 10
FWCI: 0.308
Citation percentile (by year/subfield): 58.92
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze