A simple graph G on n vettices is said to be a simple MCD-graph if G has no two cyties having the same length and has the maximum possible number of edges.Two results of the number of cy cles in G are given by introdu...A simple graph G on n vettices is said to be a simple MCD-graph if G has no two cyties having the same length and has the maximum possible number of edges.Two results of the number of cy cles in G are given by introdueing the Concept of a path decomposition and by them,the following theorem is proved:If G is a simple MCD-graph,then G is not a 2-connected planar graph and for all n except seven integer,G is not a 2-connected graph on n vertices containing a subgraph homeomor phic to K_4.展开更多
文摘A simple graph G on n vettices is said to be a simple MCD-graph if G has no two cyties having the same length and has the maximum possible number of edges.Two results of the number of cy cles in G are given by introdueing the Concept of a path decomposition and by them,the following theorem is proved:If G is a simple MCD-graph,then G is not a 2-connected planar graph and for all n except seven integer,G is not a 2-connected graph on n vertices containing a subgraph homeomor phic to K_4.
