The Matching Unique Graphs with Large Degree or Small Degree
Received:October 17, 2001  
Key Words: matching polynomial   path-tree   the matching unique  
Fund Project:
Author NameAffiliation
MA Hai-cheng Dept. of Math.
Qinghai Nationalities College
Xi'ning
China 
ZHAO Hai-xing Dept. of Math.
Qinghai Normal University
China 
Hits: 1993
Download times: 1445
Abstract:
      In this paper, all matching unique graphs are obtained for a graph G in which the degree of any vertex is either≤2 or≥ |V(G) |--3.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.02.030
View Full Text  View/Add Comment