Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26506
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Davila, Randy | en |
dc.contributor.author | Kalinowski, Thomas | en |
dc.contributor.author | Stephen, Sudeep | en |
dc.date.accessioned | 2019-03-18T08:28:39Z | - |
dc.date.available | 2019-03-18T08:28:39Z | - |
dc.date.issued | 2018-12-11 | - |
dc.identifier.citation | Discrete Applied Mathematics, v.250, p. 363-367 | en |
dc.identifier.issn | 1872-6771 | en |
dc.identifier.issn | 0166-218X | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/26506 | - |
dc.description.abstract | In this note, we study a dynamic vertex coloring for a graph G. In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black. The initial set of black vertices is called a zero forcing set if by iterating this process, all of the vertices in G become black. The zero forcing number of G is the minimum cardinality of a zero forcing set in G, and is denoted by Z(G). Davila and Kenter have conjectured in 2015 that Z(G)≥(g−3)(δ−2)+δ where g and δ denote the girth and the minimum degree of G, respectively. This conjecture has been proven for graphs with girth g≤10. In this note, we present a proof for g≥5, δ≥2, thereby settling the conjecture. | en |
dc.language | en | en |
dc.publisher | Elsevier BV, North-Holland | en |
dc.relation.ispartof | Discrete Applied Mathematics | en |
dc.title | A lower bound on the zero forcing number | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1016/j.dam.2018.04.015 | en |
dc.subject.keywords | Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | en |
local.contributor.firstname | Randy | en |
local.contributor.firstname | Thomas | en |
local.contributor.firstname | Sudeep | en |
local.subject.for2008 | 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | en |
local.subject.seo2008 | 970101 Expanding Knowledge in the Mathematical Sciences | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | davilar@uhd.edu | en |
local.profile.email | tkalinow@une.edu.au | en |
local.profile.email | sudeep.stephen@niser.ac.in | en |
local.output.category | C1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.identifier.epublicationsrecord | une-chute-20180525-083220 | en |
local.publisher.place | Netherlands | en |
local.format.startpage | 363 | en |
local.format.endpage | 367 | en |
local.identifier.scopusid | 85046868489 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 250 | en |
local.contributor.lastname | Davila | en |
local.contributor.lastname | Kalinowski | en |
local.contributor.lastname | Stephen | en |
dc.identifier.staff | une-id:tkalinow | en |
local.profile.orcid | 0000-0002-8444-6848 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/215863 | en |
local.identifier.unepublicationid | une:chute-20180525-083220 | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | A lower bound on the zero forcing number | en |
local.output.categorydescription | C1 Refereed Article in a Scholarly Journal | en |
local.search.author | Davila, Randy | en |
local.search.author | Kalinowski, Thomas | en |
local.search.author | Stephen, Sudeep | en |
local.uneassociation | Unknown | en |
local.identifier.wosid | 000449894600031 | en |
local.year.published | 2018 | en |
local.fileurl.closedpublished | https://rune.une.edu.au/web/retrieve/c8510d48-ed9a-448f-9536-d33c939ee4e1 | en |
local.subject.for2020 | 490404 Combinatorics and discrete mathematics (excl. physical combinatorics) | en |
local.subject.seo2020 | 280118 Expanding knowledge in the mathematical sciences | en |
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
22
checked on May 18, 2024
Page view(s)
1,424
checked on May 5, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.