Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

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. Three Types of Topological Indices of the Join of k Graphs
	LI Jing,WEI Fuyi
	Mathematics 19 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The join of two vertex disjoint graphs is obtained from their union by including all edges between the vertices in one graph and the vertices in the other. This paper mainly focused on the calculation formulas of Wiener indices, hyper-Wiener indices and reverse Wiener indices of the join of k graphs based on two definitions.
	TO cite this article:LI Jing,WEI Fuyi. Three Types of Topological Indices of the Join of k Graphs[OL].[19 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4516584


	2. How to decide whether an arbitrary undirected graph except for the graph of knight\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
	Xu Wandong
	Mathematics 17 January 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In the article one advanced some important concepts: cut-off-able edge, cut-off-unable edge, openable edge, unopenable edge, openable region, unopenable region, closed corridor, opened corridor, adjoint subgraph of the vertex of $d(v) geq 3$, the subgraph of double bridges with double chains, the forbidden subgraph to the Hamiltonian, etc. And one advanced and shown the necessary and sufficient condition of deciding an arbitrary undirected graph except the one of knight\\\\\\\\\\\\\\\
	TO cite this article:Xu Wandong. How to decide whether an arbitrary undirected graph except for the graph of knight\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\[OL].[17 January 2008] http://en.paper.edu.cn/en_releasepaper/content/18174

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item