On average degree of power graphs
Date of Publication
2013
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with Specialization in Computer Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Marck Anthony A. Garcia
Defense Panel Chair
Rigor B. Ponsones
Defense Panel Member
Paolo Lorenzo Y. Bautista
John Vincent S. Morales
Abstract/Summary
This thesis is an exposition of parts of the article entitled Average Degree in Graph Powers by Matt DeVos, Jessica McDonald, and Diego Scheide published online in Wiley Online Library. In this paper, the average degree of G3k+2 where k is a nonnegative integer was shown to be at least (2k + 1)(d + 1) {u100000} k(k + 1)(d + 1)2 n {u100000}1. With this result, this paper uses k 2(mod 3) for powers of G. Moreover, this thesis provides detailed discussions of proofs of theorems and examples to further explain the said article.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTU019072
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
1 computer disc ; 4 3/4 in.
Keywords
Graph theory
Recommended Citation
Dario, M., & Shin, S. (2013). On average degree of power graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/5588
Embargo Period
4-29-2021
