Matches in SemOpenAlex for { <https://semopenalex.org/work/W30363077> ?p ?o ?g. }
Showing items 1 to 50 of
50
with 100 items per page.
- W30363077 abstract ". Radio labeling of graphs is a specific type of graph labeling. The basic type of graph labeling is vertex coloring; this is where the vertices of a graph G are assigned different colors so that adjacent vertices are not given the same color. A k-coloring of a graph G is a coloring that uses k colors. The chromatic number of a graph G is the minimum value for k such that a k-coloring exists for G [2]. Radio labeling is a type of graph labeling that evolved as a way to use graph theory to try to solve the channel assignment problem: how to assign radio channels to radio transmitters so that two transmitters that are relatively close to one another do not have frequencies that cause interference between them. This problem of channel assignment was first put into a graph theoretic context by Hale [6]. In terms of graph theory, the vertices of a graph represent the locations of the radio transmitters, or radio stations, with the labels of the vertices corresponding to channels or frequencies assigned to the stations. Different restrictions on labelings of graphs have been studied to address the channel assignment problem. Radio labeling of a simple connected graph G is a labeling f : V (G) → Z such that for every pair of distinct vertices u and v of G, distance(u, v) + |f(u) − f(v)| ≥ diameter(G) + 1. The radio number of G is the smallest number m such that there exists a radio labeling f with f(v) ≤ m for all v in V (G). The radio numbers of certain families of graphs have already been found. Bounds and radio numbers of some tree graphs have been determined. Daphne Der-" @default.
- W30363077 created "2016-06-24" @default.
- W30363077 creator A5061922956 @default.
- W30363077 date "2018-11-29" @default.
- W30363077 modified "2023-10-11" @default.
- W30363077 title "On Radio Labeling of Diameter N-2 and Caterpillar Graphs" @default.
- W30363077 cites W1598832921 @default.
- W30363077 cites W1998152720 @default.
- W30363077 cites W2000483727 @default.
- W30363077 cites W2002366650 @default.
- W30363077 cites W2019349113 @default.
- W30363077 cites W2056891496 @default.
- W30363077 cites W2056979696 @default.
- W30363077 cites W20644447 @default.
- W30363077 cites W2075000620 @default.
- W30363077 cites W2597039816 @default.
- W30363077 doi "https://doi.org/10.17077/etd.5w8zgmdv" @default.
- W30363077 hasPublicationYear "2018" @default.
- W30363077 type Work @default.
- W30363077 sameAs 30363077 @default.
- W30363077 citedByCount "0" @default.
- W30363077 crossrefType "dissertation" @default.
- W30363077 hasAuthorship W30363077A5061922956 @default.
- W30363077 hasConcept C177756618 @default.
- W30363077 hasConcept C2776769236 @default.
- W30363077 hasConcept C41008148 @default.
- W30363077 hasConcept C59822182 @default.
- W30363077 hasConcept C86803240 @default.
- W30363077 hasConceptScore W30363077C177756618 @default.
- W30363077 hasConceptScore W30363077C2776769236 @default.
- W30363077 hasConceptScore W30363077C41008148 @default.
- W30363077 hasConceptScore W30363077C59822182 @default.
- W30363077 hasConceptScore W30363077C86803240 @default.
- W30363077 hasLocation W303630771 @default.
- W30363077 hasOpenAccess W30363077 @default.
- W30363077 hasPrimaryLocation W303630771 @default.
- W30363077 hasRelatedWork W1993731407 @default.
- W30363077 hasRelatedWork W2060842631 @default.
- W30363077 hasRelatedWork W2460226554 @default.
- W30363077 hasRelatedWork W2748952813 @default.
- W30363077 hasRelatedWork W2899084033 @default.
- W30363077 hasRelatedWork W2923064281 @default.
- W30363077 hasRelatedWork W2927003533 @default.
- W30363077 hasRelatedWork W2949734667 @default.
- W30363077 hasRelatedWork W3109990611 @default.
- W30363077 hasRelatedWork W4232361847 @default.
- W30363077 isParatext "false" @default.
- W30363077 isRetracted "false" @default.
- W30363077 magId "30363077" @default.
- W30363077 workType "dissertation" @default.