Matches in SemOpenAlex for { <https://semopenalex.org/work/W2034175063> ?p ?o ?g. }
Showing items 1 to 94 of
94
with 100 items per page.
- W2034175063 endingPage "638" @default.
- W2034175063 startingPage "628" @default.
- W2034175063 abstract "An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand, I. Charon, O. Hudry and A. Lobstein that if a graph on n vertices with at least one edge admits an identifying code, then a minimal identifying code has size at most n−1. They introduced classes of graphs whose smallest identifying code is of size n−1. Few conjectures were formulated to classify the class of all graphs whose minimum identifying code is of size n−1. In this paper, disproving these conjectures, we classify all finite graphs for which all but one of the vertices are needed to form an identifying code. We classify all infinite graphs needing the whole set of vertices in any identifying code. New upper bounds in terms of the number of vertices and the maximum degree of a graph are also provided." @default.
- W2034175063 created "2016-06-24" @default.
- W2034175063 creator A5016880662 @default.
- W2034175063 creator A5039055198 @default.
- W2034175063 creator A5050560944 @default.
- W2034175063 creator A5050991920 @default.
- W2034175063 creator A5065761743 @default.
- W2034175063 creator A5091820306 @default.
- W2034175063 date "2011-05-01" @default.
- W2034175063 modified "2023-10-13" @default.
- W2034175063 title "Extremal graphs for the identifying code problem" @default.
- W2034175063 cites W1589712216 @default.
- W2034175063 cites W1967536892 @default.
- W2034175063 cites W1974773302 @default.
- W2034175063 cites W2004251646 @default.
- W2034175063 cites W2037221311 @default.
- W2034175063 cites W2046561241 @default.
- W2034175063 cites W2068718955 @default.
- W2034175063 cites W2100994793 @default.
- W2034175063 cites W2161151370 @default.
- W2034175063 cites W2999073656 @default.
- W2034175063 cites W4212812385 @default.
- W2034175063 doi "https://doi.org/10.1016/j.ejc.2011.01.002" @default.
- W2034175063 hasPublicationYear "2011" @default.
- W2034175063 type Work @default.
- W2034175063 sameAs 2034175063 @default.
- W2034175063 citedByCount "39" @default.
- W2034175063 countsByYear W20341750632012 @default.
- W2034175063 countsByYear W20341750632013 @default.
- W2034175063 countsByYear W20341750632014 @default.
- W2034175063 countsByYear W20341750632015 @default.
- W2034175063 countsByYear W20341750632016 @default.
- W2034175063 countsByYear W20341750632017 @default.
- W2034175063 countsByYear W20341750632018 @default.
- W2034175063 countsByYear W20341750632020 @default.
- W2034175063 countsByYear W20341750632021 @default.
- W2034175063 countsByYear W20341750632022 @default.
- W2034175063 countsByYear W20341750632023 @default.
- W2034175063 crossrefType "journal-article" @default.
- W2034175063 hasAuthorship W2034175063A5016880662 @default.
- W2034175063 hasAuthorship W2034175063A5039055198 @default.
- W2034175063 hasAuthorship W2034175063A5050560944 @default.
- W2034175063 hasAuthorship W2034175063A5050991920 @default.
- W2034175063 hasAuthorship W2034175063A5065761743 @default.
- W2034175063 hasAuthorship W2034175063A5091820306 @default.
- W2034175063 hasBestOaLocation W20341750631 @default.
- W2034175063 hasConcept C114614502 @default.
- W2034175063 hasConcept C118615104 @default.
- W2034175063 hasConcept C122818955 @default.
- W2034175063 hasConcept C132525143 @default.
- W2034175063 hasConcept C177264268 @default.
- W2034175063 hasConcept C199360897 @default.
- W2034175063 hasConcept C2776760102 @default.
- W2034175063 hasConcept C33923547 @default.
- W2034175063 hasConcept C41008148 @default.
- W2034175063 hasConcept C80899671 @default.
- W2034175063 hasConceptScore W2034175063C114614502 @default.
- W2034175063 hasConceptScore W2034175063C118615104 @default.
- W2034175063 hasConceptScore W2034175063C122818955 @default.
- W2034175063 hasConceptScore W2034175063C132525143 @default.
- W2034175063 hasConceptScore W2034175063C177264268 @default.
- W2034175063 hasConceptScore W2034175063C199360897 @default.
- W2034175063 hasConceptScore W2034175063C2776760102 @default.
- W2034175063 hasConceptScore W2034175063C33923547 @default.
- W2034175063 hasConceptScore W2034175063C41008148 @default.
- W2034175063 hasConceptScore W2034175063C80899671 @default.
- W2034175063 hasIssue "4" @default.
- W2034175063 hasLocation W20341750631 @default.
- W2034175063 hasLocation W20341750632 @default.
- W2034175063 hasLocation W20341750633 @default.
- W2034175063 hasLocation W20341750634 @default.
- W2034175063 hasLocation W20341750635 @default.
- W2034175063 hasLocation W20341750636 @default.
- W2034175063 hasLocation W20341750637 @default.
- W2034175063 hasLocation W20341750638 @default.
- W2034175063 hasOpenAccess W2034175063 @default.
- W2034175063 hasPrimaryLocation W20341750631 @default.
- W2034175063 hasRelatedWork W1719252778 @default.
- W2034175063 hasRelatedWork W2003008160 @default.
- W2034175063 hasRelatedWork W2031098440 @default.
- W2034175063 hasRelatedWork W2381713449 @default.
- W2034175063 hasRelatedWork W2466894780 @default.
- W2034175063 hasRelatedWork W2731724293 @default.
- W2034175063 hasRelatedWork W3092119098 @default.
- W2034175063 hasRelatedWork W3173705736 @default.
- W2034175063 hasRelatedWork W4307385446 @default.
- W2034175063 hasRelatedWork W4386875525 @default.
- W2034175063 hasVolume "32" @default.
- W2034175063 isParatext "false" @default.
- W2034175063 isRetracted "false" @default.
- W2034175063 magId "2034175063" @default.
- W2034175063 workType "article" @default.