Subdivision number of large complete graphs and large complete multipartite graphs
A graph whose vertices can be represented by distinct points in the plane such that points representing adjacent vertices are 1 unit apart is called a unit-distance graph. Not all graphs are unit distance graphs. However, if every edge of a graph is subdivided by inserting a new vertex, then the res...
Saved in:
Main Author: | Gervacio, Severino V. |
---|---|
Format: | text |
Published: |
Animo Repository
2005
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3841 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4843/type/native/viewcontent/978_3_540_30540_8_10.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016) -
On the nullity of some families of r-partite graphs
by: Marcelino, Lyca DC
Published: (2020) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009)