Lorentz JÄNTSCHI and Mircea V. DIUDEA (2009) Subgraphs of Pair Vertices

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

Subgraphs of Pair Vertices

Post a Comment

CONTRIBUTORS:

	Author:	Lorentz JÄNTSCHI (Technical University of Cluj-Napoca)
	Author:	Mircea V. DIUDEA

JOURNAL:

Journal of mathematical chemistry, 45(2), 364 - 371.

YEAR:

2009

PUB TYPE:

Journal Article

SUBJECT(S):

chemistry - mathematical

DISCIPLINE:

Chemistry

HTTP:

http://dx.doi.org/10.1007/s10910-008-9411-6

LANGUAGE:

English

PUB ID:

103-462-060 (Last edited on 2009/08/10 23:52:27 GMT-6)

SPONSOR(S):

ABSTRACT:
Subgraphs obtained by applying several fragmentation criteria are investigated. Two well known criteria (Szeged and Cluj), and two new others are defined and characterized. An example is given for the discussed procedures. The matrix and polynomial representations of vertices composing each type of subgraphs were also given. Analytical formulas for the polynomials of several classes of graphs are derived. The newly introduced subgraphs/fragments, called MaxF and CMaxF, appear to have interesting properties, which are demonstrated.

STATISTICS

Click on # to view
Citations		1
References		1
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		1/66

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next