Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Mode Vertices And Mode Graphs., Jobriath Scott Kauffman
Mode Vertices And Mode Graphs., Jobriath Scott Kauffman
Electronic Theses and Dissertations
The eccentricity of a vertex, v, of a connected graph, G, is the distance to a furthest vertex from v. A mode vertex of a connected graph, G, is a vertex whose eccentricity occurs as often in the eccentricity sequence of G as the eccentricity of any other vertex. The mode of a graph, G, is the subgraph induced by the mode vertices of G. A mode graph is a connected graph for which each vertex is a mode vertex. Note that mode graphs are a generalization of self-centered graphs. This paper presents some …
Vertices In Total Dominating Sets., Robert Elmer Dautermann Iii
Vertices In Total Dominating Sets., Robert Elmer Dautermann Iii
Electronic Theses and Dissertations
Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and …
The Edge-Isoperimetric Problem For The Square Tessellation Of Plane, Sunmi Lee
The Edge-Isoperimetric Problem For The Square Tessellation Of Plane, Sunmi Lee
Theses Digitization Project
The solution for the edge-isoperimetric problem (EIP) of the square tessellation of plane is investigated and solved. Summaries of the stabilization theory and previous research dealing with the EIP are stated. These techniques enable us to solve the EIP of the cubical tessellation.
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Theses Digitization Project
Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.