Matches in SemOpenAlex for { <https://semopenalex.org/work/W4308731351> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W4308731351 endingPage "2634" @default.
- W4308731351 startingPage "2619" @default.
- W4308731351 abstract "An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighborhoods within $C$. These codes have been widely studied for over two decades. We give an improvement over all the best known upper bounds, some of which have stood for over 20 years, for identifying codes in trees, proving the upper bound of $(n+ell)/2$, where $n$ is the order and $ell$ is the number of leaves (pendant vertices) of the graph. In addition to being an improvement in size, the new upper bound is also an improvement in generality, as it actually holds for bipartite graphs having no twins (pairs of vertices with the same closed or open neighborhood) of degree 2 or greater. We also show that the bound is tight for an infinite class of graphs and that there are several structurally different families of trees attaining the bound. We then use our bound to derive a tight upper bound of $2n/3$ for twin-free bipartite graphs of order $n$ and characterize the extremal examples as 2-corona graphs of bipartite graphs. This is the best possible, as there exist twin-free graphs, and trees with twins, that need $n-1$ vertices in any of their identifying codes. We also generalize the existing upper bound of $5n/7$ for graphs of order $n$ and girth at least 5 when there are no leaves to the upper bound $frac{5n+2ell}{7}$ when leaves are allowed. This is tight for the 7-cycle $C_7$ and for all stars." @default.
- W4308731351 created "2022-11-15" @default.
- W4308731351 creator A5039055198 @default.
- W4308731351 creator A5071276295 @default.
- W4308731351 date "2022-11-09" @default.
- W4308731351 modified "2023-10-02" @default.
- W4308731351 title "Revisiting and Improving Upper Bounds for Identifying Codes" @default.
- W4308731351 cites W1513939901 @default.
- W4308731351 cites W1745697583 @default.
- W4308731351 cites W1965065197 @default.
- W4308731351 cites W1983544957 @default.
- W4308731351 cites W2004251646 @default.
- W4308731351 cites W2006716595 @default.
- W4308731351 cites W2034175063 @default.
- W4308731351 cites W2037221311 @default.
- W4308731351 cites W2048809233 @default.
- W4308731351 cites W2056975974 @default.
- W4308731351 cites W2066524557 @default.
- W4308731351 cites W2080276120 @default.
- W4308731351 cites W2100994793 @default.
- W4308731351 cites W2166937745 @default.
- W4308731351 cites W2761633734 @default.
- W4308731351 cites W2915379875 @default.
- W4308731351 cites W2962934768 @default.
- W4308731351 cites W2964081956 @default.
- W4308731351 cites W2964213311 @default.
- W4308731351 cites W4212812385 @default.
- W4308731351 cites W4225860123 @default.
- W4308731351 cites W560340026 @default.
- W4308731351 cites W902440907 @default.
- W4308731351 doi "https://doi.org/10.1137/22m148999x" @default.
- W4308731351 hasPublicationYear "2022" @default.
- W4308731351 type Work @default.
- W4308731351 citedByCount "3" @default.
- W4308731351 countsByYear W43087313512023 @default.
- W4308731351 crossrefType "journal-article" @default.
- W4308731351 hasAuthorship W4308731351A5039055198 @default.
- W4308731351 hasAuthorship W4308731351A5071276295 @default.
- W4308731351 hasBestOaLocation W43087313512 @default.
- W4308731351 hasConcept C114614502 @default.
- W4308731351 hasConcept C118615104 @default.
- W4308731351 hasConcept C132525143 @default.
- W4308731351 hasConcept C134306372 @default.
- W4308731351 hasConcept C197657726 @default.
- W4308731351 hasConcept C33923547 @default.
- W4308731351 hasConcept C77553402 @default.
- W4308731351 hasConceptScore W4308731351C114614502 @default.
- W4308731351 hasConceptScore W4308731351C118615104 @default.
- W4308731351 hasConceptScore W4308731351C132525143 @default.
- W4308731351 hasConceptScore W4308731351C134306372 @default.
- W4308731351 hasConceptScore W4308731351C197657726 @default.
- W4308731351 hasConceptScore W4308731351C33923547 @default.
- W4308731351 hasConceptScore W4308731351C77553402 @default.
- W4308731351 hasFunder F4320320883 @default.
- W4308731351 hasFunder F4320321108 @default.
- W4308731351 hasFunder F4320321726 @default.
- W4308731351 hasIssue "4" @default.
- W4308731351 hasLocation W43087313511 @default.
- W4308731351 hasLocation W43087313512 @default.
- W4308731351 hasLocation W43087313513 @default.
- W4308731351 hasLocation W43087313514 @default.
- W4308731351 hasOpenAccess W4308731351 @default.
- W4308731351 hasPrimaryLocation W43087313511 @default.
- W4308731351 hasRelatedWork W1951301781 @default.
- W4308731351 hasRelatedWork W1996072328 @default.
- W4308731351 hasRelatedWork W2054383364 @default.
- W4308731351 hasRelatedWork W2124354004 @default.
- W4308731351 hasRelatedWork W2340841397 @default.
- W4308731351 hasRelatedWork W2951336538 @default.
- W4308731351 hasRelatedWork W2963675245 @default.
- W4308731351 hasRelatedWork W2989925696 @default.
- W4308731351 hasRelatedWork W3005925191 @default.
- W4308731351 hasRelatedWork W3205099810 @default.
- W4308731351 hasVolume "36" @default.
- W4308731351 isParatext "false" @default.
- W4308731351 isRetracted "false" @default.
- W4308731351 workType "article" @default.