{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-3995"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-3995","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"On Properties of r<sub>w</sub>-Regular Graphs","abstract":"If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for vertex-weighted graphs can be stated as follows: A vertex-weighted graph is said to be rw-regular if the sum of the weights in the neighborhood of every vertex is rw. If all vertices are assigned the unit weight of 1, then this is equivalent to the definition for r-regular graphs. In this thesis, we determine if a graph has a weighting scheme that makes it a weighted regular graph or prove no such scheme exists for a number of special classes of graphs such as paths, stars, caterpillars, spiders and wheels.","abstract_html":"If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for vertex-weighted graphs can be stated as follows: A vertex-weighted graph is said to be rw-regular if the sum of the weights in the neighborhood of every vertex is rw. If all vertices are assigned the unit weight of 1, then this is equivalent to the definition for r-regular graphs. In this thesis, we determine if a graph has a weighting scheme that makes it a weighted regular graph or prove no such scheme exists for a number of special classes of graphs such as paths, stars, caterpillars, spiders and wheels.","abstract_has_math":false,"creators":["Samani, Franklina"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-12-01T08:00:00Z","date_published":"2015-12-01T08:00:00Z","updated_at":"2026-11-19T07:54:29Z","subjects":["graph theory","weighted graph","aw-regular graph.","Mathematics"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/2601","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/2601","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/3995/viewcontent/SamaniF111815f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-3995","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Samani, Franklina"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-11-09T08:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-12-01T08:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["graph theory","weighted graph","aw-regular graph.","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/3995/viewcontent/SamaniF111815f.pdf","https://dc.etsu.edu/etd/2601"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for vertex-weighted graphs can be stated as follows: A vertex-weighted graph is said to be rw-regular if the sum of the weights in the neighborhood of every vertex is rw. If all vertices are assigned the unit weight of 1, then this is equivalent to the definition for r-regular graphs. In this thesis, we determine if a graph has a weighting scheme that makes it a weighted regular graph or prove no such scheme exists for a number of special classes of graphs such as paths, stars, caterpillars, spiders and wheels."]},{"key":"dc:title","label":"Title","values":["On Properties of r<sub>w</sub>-Regular Graphs"]}]}],"canonical_facts":{"dc:creator":["Samani, Franklina"],"dc:date.available":["2015-11-09T08:00:00Z"],"dc:date.issued":["2015-12-01T08:00:00Z"],"dc:description.abstract":["If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for vertex-weighted graphs can be stated as follows: A vertex-weighted graph is said to be rw-regular if the sum of the weights in the neighborhood of every vertex is rw. If all vertices are assigned the unit weight of 1, then this is equivalent to the definition for r-regular graphs. In this thesis, we determine if a graph has a weighting scheme that makes it a weighted regular graph or prove no such scheme exists for a number of special classes of graphs such as paths, stars, caterpillars, spiders and wheels."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/3995/viewcontent/SamaniF111815f.pdf","https://dc.etsu.edu/etd/2601"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["graph theory","weighted graph","aw-regular graph.","Mathematics"],"dc:title":["On Properties of r<sub>w</sub>-Regular Graphs"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:54:29Z"}