Under the conditions of compatility or sub -c ompatility between a sigle-valued mapping and set-valued mapping, this paper d iscusses the existence of common fixed points for two set-valued mappings and a single-value...Under the conditions of compatility or sub -c ompatility between a sigle-valued mapping and set-valued mapping, this paper d iscusses the existence of common fixed points for two set-valued mappings and a single-valued mapping in complete, convex matric spaces. We extend and develop the main results.展开更多
Let T be a tree with matching number μ(T). In this paper we obtain the following result: If T has no perfect matchings, thenμ(T) is a lower bound for the number of nonzero Laplacian eigenvalues of T which are smalle...Let T be a tree with matching number μ(T). In this paper we obtain the following result: If T has no perfect matchings, thenμ(T) is a lower bound for the number of nonzero Laplacian eigenvalues of T which are smaller than 2.展开更多
基金Supported by the National Natural Science Foundation of China(10771141)the Natural Science Foundation of Zhejiang Province(Y6110287)Teaching Reformation Foundation of Graduate Student of Hangzhou Normal University
文摘Under the conditions of compatility or sub -c ompatility between a sigle-valued mapping and set-valued mapping, this paper d iscusses the existence of common fixed points for two set-valued mappings and a single-valued mapping in complete, convex matric spaces. We extend and develop the main results.
基金This research is supported by Anhui provincial Natural Science Foundation, Natural Science Foundation of Department of Education of Anhui Province of China (2004kj027)the Project of Research for Young Teachers of Universities of Anhui Province of China (2003jql01)and the Project of Anhui University for Talents Group Construction.
文摘Let T be a tree with matching number μ(T). In this paper we obtain the following result: If T has no perfect matchings, thenμ(T) is a lower bound for the number of nonzero Laplacian eigenvalues of T which are smaller than 2.