|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE NAME:
|
|
|
CONF. LOCATION:
|
Cluj-Napoca, Romania
|
|
CONFERENCE YEAR:
|
2006
|
|
PUB TYPE:
|
Conference Presentation
|
|
SUBJECT(S):
|
informatics - fundamentals; mathematics - algebra; mathematics - modeling; mathematics - number theory
|
|
DISCIPLINE:
|
Mathematics
|
|
HTTP:
|
http://lori.academicdirect.org/works/?id=96
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-436-069
(Last edited on
2007/07/08 09:06:49 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
Subgraphs which result through applying of matrix criterions of fragmentation were investigated. Two well known matrix criterions (Szeged and Cluj), and two others are defined and characterized through properties. An example graph was used to show the procedure of subgraphs obtaining. The graph polynomial for number of vertices of subgraphs was also investigated for the general case and polynomials for the given example were calculated. The new introduced criterions, called MaxF and CMaxF shows to have very interesting properties.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
2
|
|
References
|
|
2
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/197
|
|
|
|
|
|
|
| Prev |
Next |
|
