Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 3 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. The Utility of A Class of Economic Network | |||
Xu Lan,Xu Ying | |||
Mathematics 20 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Networks play an important role in a wide range of economic phenomena. Despite this fact, standard economic theory rarely considers economic networks explicitly in its analysis. However, a major innovation in economic theory has been the use of methods stemming from graph theory to describe and study relations between economic agents in networks. This recent development has lead to a fast increase in theoretical research on economic networks. In this paper, we consider the utility of a class of economic network. | |||
TO cite this article:Xu Lan,Xu Ying. The Utility of A Class of Economic Network[OL].[20 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4514564 |
2. A graph invariant and 2-factoriations of a graph | |||
Xie Yingtai | |||
Mathematics 06 June 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A spanning subgraph of a graph G is called a [0,2]-factor of G, if for. is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors for a G.A characteristic number for a [0,2]-factor, which reflect the number of the paths and isolate vertices in it,is defineted. The [0,2]-factor of G is called maximum if its characteristic number is minimum, and is called characteristic number of G. It to be proved that characteristic number of graph is a graph invariant and a polynomial time algorithm for computing a maximum [0,2]-factor of a graph G has been given in this paper. A [0,2]-factor is Called a 2-factor, if its characteristic number is zero. That is, a 2-factor is a set of some disjoint cycles, that span G.We propose a A polynomial time algorism for computing 2-factor from a [0,2]-factor,which can be got easily. A HAMILTON Cycle is a 2-factor, therefore a necessary condition of a HAMILTON Graph is that, the graph have a 2-factor or the characteristic number of the graph is zero. The algorism, given in this paper, make it possible to examine the condition in polynomial time. | |||
TO cite this article:Xie Yingtai. A graph invariant and 2-factoriations of a graph[OL].[ 6 June 2010] http://en.paper.edu.cn/en_releasepaper/content/4375381 |
3. 5-incidence chromatic motif and its application | |||
Meng Xianyong | |||
Mathematics 26 March 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Incidence coloring of a graph G is a mapping from the set of incidences to a color-set C such that adjacent incidences of G are assigned distinct colors. The incidence coloring conjecture (ICC) states that the incidence coloring number of every graph is at most maximum degree summing 2, .Although ICC is false in general, but it has been showed for any graph with maximum degree summing 2, ICC holds. It is NP-complete to determine whether a graph with maximum degree less3 is 4-incidencecolorable. In this paper, we study some graphs with incidence coloring number is 5. | |||
TO cite this article:Meng Xianyong . 5-incidence chromatic motif and its application[OL].[26 March 2010] http://en.paper.edu.cn/en_releasepaper/content/41208 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated