{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-4976"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-4976","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Italian Domination on Ladders and Related Products","abstract":"An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \\to \\{0,1,2\\}$, and for each vertex $v \\in V$ for which $f(v) = 0$, we have $\\sum_{u\\in N(v)}f(u) \\geq 2$. The weight of an Italian dominating function is $f(V) = \\sum_{v\\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms, mobius ladders and related products including categorical products $G\\times K_2$ and lexicographic products $G\\cdot K_2$. Finally, we will conclude with open problems.","abstract_html":"An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \\to \\{0,1,2\\}$, and for each vertex $v \\in V$ for which $f(v) = 0$, we have <span class=\"etd-inline-math\">\\sum<sub>u\\in N(v)</sub>f(u) \\geq 2</span>. The weight of an Italian dominating function is <span class=\"etd-inline-math\">f(V) = \\sum<sub>v\\in V(G)</sub>f(v)</span>. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph <span class=\"etd-inline-math\">K<sub>2</sub></span>. We will find the value of the Italian domination number for ladders, specific families of prisms, mobius ladders and related products including categorical products <span class=\"etd-inline-math\">G\\times K<sub>2</sub></span> and lexicographic products <span class=\"etd-inline-math\">G\\cdot K<sub>2</sub></span>. Finally, we will conclude with open problems.","abstract_has_math":true,"creators":["Gardner, Bradley"],"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":2018,"date_issued":"2018-12-01T08:00:00Z","date_published":"2018-12-01T08:00:00Z","updated_at":"2026-11-19T07:55:46Z","subjects":["graph theory","graph products","Italian domination","Discrete Mathematics and Combinatorics"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3509","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3509","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/4976/viewcontent/GardnerB120318f.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-4976","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Gardner, Bradley"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2018-11-13T08:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-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","graph products","Italian domination","Discrete Mathematics and Combinatorics"]}]},{"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/4976/viewcontent/GardnerB120318f.pdf","https://dc.etsu.edu/etd/3509"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \\to \\{0,1,2\\}$, and for each vertex $v \\in V$ for which $f(v) = 0$, we have $\\sum_{u\\in N(v)}f(u) \\geq 2$. The weight of an Italian dominating function is $f(V) = \\sum_{v\\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms, mobius ladders and related products including categorical products $G\\times K_2$ and lexicographic products $G\\cdot K_2$. Finally, we will conclude with open problems."]},{"key":"dc:title","label":"Title","values":["Italian Domination on Ladders and Related Products"]}]}],"canonical_facts":{"dc:creator":["Gardner, Bradley"],"dc:date.available":["2018-11-13T08:00:00Z"],"dc:date.issued":["2018-12-01T08:00:00Z"],"dc:description.abstract":["An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \\to \\{0,1,2\\}$, and for each vertex $v \\in V$ for which $f(v) = 0$, we have $\\sum_{u\\in N(v)}f(u) \\geq 2$. The weight of an Italian dominating function is $f(V) = \\sum_{v\\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms, mobius ladders and related products including categorical products $G\\times K_2$ and lexicographic products $G\\cdot K_2$. Finally, we will conclude with open problems."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/4976/viewcontent/GardnerB120318f.pdf","https://dc.etsu.edu/etd/3509"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["graph theory","graph products","Italian domination","Discrete Mathematics and Combinatorics"],"dc:title":["Italian Domination on Ladders and Related Products"],"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:55:46Z"}