Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Denise Sakai Troxell"'
Publikováno v:
Discrete Applied Mathematics. 285:380-396
In a zero forcing process, an initial vertex coloring of a graph is updated iteratively according to the following conversion rule: an uncolored vertex becomes colored if it is the only uncolored neighbor of some colored vertex. In this process, a ze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6629cfe28b37698eeddc2053c9583255
https://doi.org/10.1016/j.dam.2020.06.002
https://doi.org/10.1016/j.dam.2020.06.002
Autor:
Matthew Beaudouin-Lafon, Nathaniel J. Karst, Serena Chen, Margaret Crawford, Louise Nielsen, Denise Sakai Troxell
Publikováno v:
Discrete Applied Mathematics. 282:35-47
In a zero forcing process, an initial vertex coloring of a graph is updated iteratively according to the following conversion rule: an uncolored vertex becomes colored if it is the only uncolored neighbor of some colored vertex. In this process, a ze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3585b680fcb65b725933bafa74ead5e4
https://doi.org/10.1016/j.dam.2019.11.015
https://doi.org/10.1016/j.dam.2019.11.015
Publikováno v:
Involve 12, no. 5 (2019), 871-882
A simple graph [math] is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree [math] with positive weights and nonnegative numbers [math] and [math] such that the leaves of [math] are exactly the vertices of [math] , and [math]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c037056c09b56d4e209c3a997520ed77
https://doi.org/10.2140/involve.2019.12.871
https://doi.org/10.2140/involve.2019.12.871
Autor:
Matthew Beaudouin-Lafon, Jessica Oehrlein, Denise Sakai Troxell, Serena Chen, Nathaniel J. Karst
Publikováno v:
Involve 11, no. 1 (2018), 67-80
An L(2,1)-labeling of a graph is an assignment of nonnegative integers to its vertices such that adjacent vertices are assigned labels at least two apart, and vertices at distance two are assigned labels at least one apart. The [math] -number of a gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8212ec55cf3315589e35c10e8508f8d3
https://doi.org/10.2140/involve.2018.11.67
https://doi.org/10.2140/involve.2018.11.67
Publikováno v:
Involve 8, no. 3 (2015), 535-540
An [math] -labeling of a graph [math] is a function assigning a nonnegative integer to each vertex such that adjacent vertices are labeled with integers differing by at least 2 and vertices at distance two are labeled with integers differing by at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b37f85f74503df497d70dfc264f6bc8
https://doi.org/10.2140/involve.2015.8.535
https://doi.org/10.2140/involve.2015.8.535
Publikováno v:
Discrete Applied Mathematics. 181:139-151
Given a positive integer d , an L ( d , 1 ) -labeling of a graph G is an assignment of nonnegative integers to its vertices such that adjacent vertices must receive integers at least d apart, and vertices at distance two must receive integers at leas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa4b1b432570ddffca32a9a4935f662c
https://doi.org/10.1016/j.dam.2014.10.010
https://doi.org/10.1016/j.dam.2014.10.010
Publikováno v:
Discrete Applied Mathematics. 178:101-108
The spectrum allocation problem in wireless communications can be modeled through vertex labelings of a graph, wherein each vertex represents a transmitter and edges connect vertices whose corresponding transmitters are operating in close proximity.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72c03522a1aa504152cddc8332bc207f
https://doi.org/10.1016/j.dam.2014.06.022
https://doi.org/10.1016/j.dam.2014.06.022
Publikováno v:
Journal of Combinatorial Optimization. 30:34-41
For an integer $$d \ge 2$$d?2, an $$L(d$$L(d,1)-labeling of a graph $$G$$G is a function $$f$$f from its vertex set to the non-negative integers such that $${\vert }f(x) - f(y){\vert } \ge d$$|f(x)?f(y)|?d if vertices $$x$$x and $$y$$y are adjacent,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8754b6fdd1dbd095f418c31e20cae430
https://doi.org/10.1007/s10878-013-9632-x
https://doi.org/10.1007/s10878-013-9632-x
Publikováno v:
Discrete Applied Mathematics. 161:881-888
The problem of assigning frequencies to transmitters in a radio network can be modeled through vertex labelings of a graph, wherein each vertex represents a transmitter and edges connect vertices whose corresponding transmitters are operating in clos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a45a117b7d6a5a95f20aa71404779d5
https://doi.org/10.1016/j.dam.2012.11.007
https://doi.org/10.1016/j.dam.2012.11.007
Publikováno v:
Applied Mathematics Letters. 24:950-957
An L ( 2 , 1 ) -labeling of a graph G is a function f : V ( G ) → { 0 , 1 , … , k } such that | f ( x ) − f ( y ) | ≥ 2 if x and y are adjacent vertices, and | f ( x ) − f ( y ) | ≥ 1 if x and y are at distance 2. Such labelings were intr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9f5dbbe8214ba73bfccf43aed9b6890
https://doi.org/10.1016/j.aml.2011.01.004
https://doi.org/10.1016/j.aml.2011.01.004