Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
Edmonds with signature.pdf (347.32 KB)
ETD Abstract Container
Abstract Header
Friendly and Unfriendly k-Partitions
Author Info
Edmonds, Rex W
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=ysu1420640472
Abstract Details
Year and Degree
2014, Master of Science in Mathematics, Youngstown State University, Department of Mathematics and Statistics.
Abstract
A friendly partition of a graph is a partition of the vertices into two sets so that every vertex has at least as many neighbors (adjacent vertices) in its own set as in the other set. An unfriendly partition of a graph is a partition of the vertices into two sets so that every vertex has at least as many neighbors in the other set as in its own set. In this paper we extend these concepts to
k
-partitions of vertices. We define and explore friendly and unfriendly edge partitions and extend these concepts to
k
-partitions of edges. In extending these concepts to the edges of a graph, we will show that one type of a friendly vertex partition of a K
m,n
graph can be used to produce a friendly edge partition. We will also look at partitions that are both friendly and unfriendly (dual). We will investigate these properties for several types of graphs (star, tree, K
n
, C
n
, K
m,n
).
Committee
Anita O'Mellan, PhD (Advisor)
Eric Wingler, PhD (Committee Member)
Jacek Fabrykowski, PhD (Committee Member)
Pages
43 p.
Subject Headings
Mathematics
;
Theoretical Mathematics
Keywords
Friendly and unfriendly vertex and edge partitions
;
Dual partitions
;
Constant edge partitions
;
m-cycles
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Edmonds, R. W. (2014).
Friendly and Unfriendly k-Partitions
[Master's thesis, Youngstown State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1420640472
APA Style (7th edition)
Edmonds, Rex.
Friendly and Unfriendly k-Partitions.
2014. Youngstown State University, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=ysu1420640472.
MLA Style (8th edition)
Edmonds, Rex. "Friendly and Unfriendly k-Partitions." Master's thesis, Youngstown State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1420640472
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
ysu1420640472
Download Count:
454
Copyright Info
© 2014, all rights reserved.
This open access ETD is published by Youngstown State University and OhioLINK.