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: 2116
Download times: 1509
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  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.