A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each vertex a label from the set {0,1,2,...} such that |f(u)−f(v)| ≥ diam(G)−d(u,v)+1 holds for any two distinct vertices, u and v in G (i.e., u, v ∈ V (G)). The greatest value assigned to a vertex by f is called the span of the radio labeling f, i.e., spanf =max{f(v) : v ∈ V (G)}. The radio number of G, rn(G), is the minimum span of f over all radio labelings f of G. In this paper, we provide a lower bound for the radio number of the fourth power path.
","abstract_html":"<p>A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each vertex a label from the set {0,1,2,...} such that |f(u)−f(v)| ≥ diam(G)−d(u,v)+1 holds for any two distinct vertices, u and v in G (i.e., u, v ∈ V (G)). The greatest value assigned to a vertex by f is called the span of the radio labeling f, i.e., spanf =max{f(v) : v ∈ V (G)}. The radio number of G, rn(G), is the minimum span of f over all radio labelings f of G. In this paper, we provide a lower bound for the radio number of the fourth power path.</p>","abstract_has_math":false,"creators":["Alegria, Linda V"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Lo, Min-Lin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-01T08:00:00Z","date_published":"2014-12-01T08:00:00Z","updated_at":"2026-07-24T01:52:45Z","subjects":["Graph Theory","Fourth Power Path","Radio Number","Radio Labeling","Mathematics","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/112","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lo, Min-Lin"]},{"key":"dc:creator","label":"Author","values":["Alegria, Linda V"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2014-11-14T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph Theory","Fourth Power Path","Radio Number","Radio Labeling","Mathematics","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/112"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each vertex a label from the set {0,1,2,...} such that |f(u)−f(v)| ≥ diam(G)−d(u,v)+1 holds for any two distinct vertices, u and v in G (i.e., u, v ∈ V (G)). The greatest value assigned to a vertex by f is called the span of the radio labeling f, i.e., spanf =max{f(v) : v ∈ V (G)}. The radio number of G, rn(G), is the minimum span of f over all radio labelings f of G. In this paper, we provide a lower bound for the radio number of the fourth power path.
"]},{"key":"dc:title","label":"Title","values":["Radio Number for Fourth Power Paths"]}]}],"canonical_facts":{"dc:contributor":["Lo, Min-Lin"],"dc:creator":["Alegria, Linda V"],"dc:date.available":["2014-11-14T08:00:00Z"],"dc:description.abstract":["A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each vertex a label from the set {0,1,2,...} such that |f(u)−f(v)| ≥ diam(G)−d(u,v)+1 holds for any two distinct vertices, u and v in G (i.e., u, v ∈ V (G)). The greatest value assigned to a vertex by f is called the span of the radio labeling f, i.e., spanf =max{f(v) : v ∈ V (G)}. The radio number of G, rn(G), is the minimum span of f over all radio labelings f of G. In this paper, we provide a lower bound for the radio number of the fourth power path.
"],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/112"],"dc:subject":["Graph Theory","Fourth Power Path","Radio Number","Radio Labeling","Mathematics","Other Mathematics"],"dc:title":["Radio Number for Fourth Power Paths"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-07-24T01:52:45Z"}