On the Enumeration of Labeled Graphs with k Cycles
Received:May 14, 1990  
Key Word:   
Fund ProjectL:
Author NameAffiliation
Liu Bolian South China Normal University
Guangzhou 
Zhang Xiankun Guangdong Mechanical College
Guangzhou 
Hits: 1630
Download times: 1070
Abstract:
      Enumeration of labeled connected graphs with k cycles is an open problem . Up to now it has been settled only for k = 1, 2. Unfortunately , these given for-mulas are very complicated . In this paper we improve a series of enum nerations and solve the enumeration problem for k = 3.
Citation:
DOI:10.3770/j.issn:1000-341X.1991.04.012
View Full Text  View/Add Comment  Download reader