Conference
View in EDS

Locating-dominating partitions in graphs

Bibliographic Details
Title: Locating-dominating partitions in graphs
Authors: Pelayo Melero, Ignacio Manuel, Hernando Martín, María del Carmen, Mora Giné, Mercè
Contributors: Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions, Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
Publication Year: 2016
Collection: Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge
Subject Terms: Àrees temàtiques de la UPC::Informàtica::Infografia, Graph theory--Data processing, dominating partition, locating partition, coloring-locating partition, coloring-locating-dominating partition, Grafs, Teoria de
Description: Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . , d(v, Sk)). The partition ¿ is called a locating partition of G if, for every pair of distinct vertices u, v ¿ V , r(u, ¿) 6= r(v, ¿). A locating partition ¿ is called metriclocating-dominating partition (an MLD-partition for short) of G if it is also dominating, ; Postprint (published version)
Document Type: conference object
File Description: application/pdf
Language: English
Relation: http://www.mate.unlp.edu.ar/~liliana/lawclique_2016/prolist.pdf; https://hdl.handle.net/2117/104422
Availability: https://hdl.handle.net/2117/104422
Rights: http://creativecommons.org/licenses/by-nc-nd/3.0/es/ ; Open Access ; Attribution-NonCommercial-NoDerivs 3.0 Spain
Accession Number: edsbas.CD4D6C60
Database: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/2117/104422#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.CD4D6C60
RelevancyScore: 872
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 872.178283691406
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Locating-dominating partitions in graphs
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Pelayo+Melero%2C+Ignacio+Manuel%22">Pelayo Melero, Ignacio Manuel</searchLink><br /><searchLink fieldCode="AR" term="%22Hernando+Martín%2C+María+del+Carmen%22">Hernando Martín, María del Carmen</searchLink><br /><searchLink fieldCode="AR" term="%22Mora+Giné%2C+Mercè%22">Mora Giné, Mercè</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Universitat Politècnica de Catalunya. Departament de Matemàtiques<br />Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions<br />Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2016
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Àrees+temàtiques+de+la+UPC%3A%3AInformàtica%3A%3AInfografia%22">Àrees temàtiques de la UPC::Informàtica::Infografia</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory--Data+processing%22">Graph theory--Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22dominating+partition%22">dominating partition</searchLink><br /><searchLink fieldCode="DE" term="%22locating+partition%22">locating partition</searchLink><br /><searchLink fieldCode="DE" term="%22coloring-locating+partition%22">coloring-locating partition</searchLink><br /><searchLink fieldCode="DE" term="%22coloring-locating-dominating+partition%22">coloring-locating-dominating partition</searchLink><br /><searchLink fieldCode="DE" term="%22Grafs%22">Grafs</searchLink><br /><searchLink fieldCode="DE" term="%22Teoria+de%22">Teoria de</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . , d(v, Sk)). The partition ¿ is called a locating partition of G if, for every pair of distinct vertices u, v ¿ V , r(u, ¿) 6= r(v, ¿). A locating partition ¿ is called metriclocating-dominating partition (an MLD-partition for short) of G if it is also dominating, ; Postprint (published version)
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: conference object
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://www.mate.unlp.edu.ar/~liliana/lawclique_2016/prolist.pdf; https://hdl.handle.net/2117/104422
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/2117/104422
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: http://creativecommons.org/licenses/by-nc-nd/3.0/es/ ; Open Access ; Attribution-NonCommercial-NoDerivs 3.0 Spain
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.CD4D6C60
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.CD4D6C60
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Àrees temàtiques de la UPC::Informàtica::Infografia
        Type: general
      – SubjectFull: Graph theory--Data processing
        Type: general
      – SubjectFull: dominating partition
        Type: general
      – SubjectFull: locating partition
        Type: general
      – SubjectFull: coloring-locating partition
        Type: general
      – SubjectFull: coloring-locating-dominating partition
        Type: general
      – SubjectFull: Grafs
        Type: general
      – SubjectFull: Teoria de
        Type: general
    Titles:
      – TitleFull: Locating-dominating partitions in graphs
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Pelayo Melero, Ignacio Manuel
      – PersonEntity:
          Name:
            NameFull: Hernando Martín, María del Carmen
      – PersonEntity:
          Name:
            NameFull: Mora Giné, Mercè
      – PersonEntity:
          Name:
            NameFull: Universitat Politècnica de Catalunya. Departament de Matemàtiques
      – PersonEntity:
          Name:
            NameFull: Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
      – PersonEntity:
          Name:
            NameFull: Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1