Reports de recerca
http://hdl.handle.net/2117/3919
Wed, 25 May 2016 09:44:41 GMT2016-05-25T09:44:41ZOn the Partition Dimension and the Twin Number of a Graph
http://hdl.handle.net/2117/87267
On the Partition Dimension and the Twin Number of a Graph
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension n
Tue, 24 May 2016 10:33:18 GMThttp://hdl.handle.net/2117/872672016-05-24T10:33:18ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelA partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension nSEPsFLAREs: Finalised Design Definition File (DDF)
http://hdl.handle.net/2117/86610
SEPsFLAREs: Finalised Design Definition File (DDF)
García Rigo, Alberto; Hernández Pajares, Manuel; Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W
Wed, 04 May 2016 17:19:50 GMThttp://hdl.handle.net/2117/866102016-05-04T17:19:50ZGarcía Rigo, AlbertoHernández Pajares, ManuelNuñez, MarlonQahwaji, RamiAshamari, Omar WSEPsFLAREs: AR meeting presentation
http://hdl.handle.net/2117/86609
SEPsFLAREs: AR meeting presentation
García Rigo, Alberto; Hernández Pajares, Manuel; Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W
Wed, 04 May 2016 17:08:46 GMThttp://hdl.handle.net/2117/866092016-05-04T17:08:46ZGarcía Rigo, AlbertoHernández Pajares, ManuelNuñez, MarlonQahwaji, RamiAshamari, Omar WSEPsFLAREs: Technical Specification
http://hdl.handle.net/2117/86607
SEPsFLAREs: Technical Specification
García Rigo, Alberto; Hernández Pajares, Manuel; Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W
Wed, 04 May 2016 16:56:38 GMThttp://hdl.handle.net/2117/866072016-05-04T16:56:38ZGarcía Rigo, AlbertoHernández Pajares, ManuelNuñez, MarlonQahwaji, RamiAshamari, Omar WSEPsFLAREs: Migration File (MF-v2)
http://hdl.handle.net/2117/86605
SEPsFLAREs: Migration File (MF-v2)
Pérez, Gustau; García Rigo, Alberto; Hernández Pajares, Manuel
Wed, 04 May 2016 16:41:17 GMThttp://hdl.handle.net/2117/866052016-05-04T16:41:17ZPérez, GustauGarcía Rigo, AlbertoHernández Pajares, ManuelSEPsFLAREs: Final Report
http://hdl.handle.net/2117/86604
SEPsFLAREs: Final Report
Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W; García Rigo, Alberto; Hernández Pajares, Manuel
Wed, 04 May 2016 16:24:00 GMThttp://hdl.handle.net/2117/866042016-05-04T16:24:00ZNuñez, MarlonQahwaji, RamiAshamari, Omar WGarcía Rigo, AlbertoHernández Pajares, ManuelIPRESES. Additional Technical Note #8: Virtual Box and Ciraolo SW (v1.0)
http://hdl.handle.net/2117/86602
IPRESES. Additional Technical Note #8: Virtual Box and Ciraolo SW (v1.0)
García Rigo, Alberto; Hernández Pajares, Manuel; Olivares Pulido, German
Wed, 04 May 2016 16:17:15 GMThttp://hdl.handle.net/2117/866022016-05-04T16:17:15ZGarcía Rigo, AlbertoHernández Pajares, ManuelOlivares Pulido, GermanSEPsFLAREs: Abstract
http://hdl.handle.net/2117/86598
SEPsFLAREs: Abstract
Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W; García Rigo, Alberto; Hernández Pajares, Manuel
Wed, 04 May 2016 15:51:43 GMThttp://hdl.handle.net/2117/865982016-05-04T15:51:43ZNuñez, MarlonQahwaji, RamiAshamari, Omar WGarcía Rigo, AlbertoHernández Pajares, ManuelSEPsFLAREs: Executive Summary
http://hdl.handle.net/2117/86424
SEPsFLAREs: Executive Summary
Nuñez, Marlon; Qahwaji, Rami; Ashamari, Omar W; García Rigo, Alberto; Hernández Pajares, Manuel
Fri, 29 Apr 2016 11:08:39 GMThttp://hdl.handle.net/2117/864242016-04-29T11:08:39ZNuñez, MarlonQahwaji, RamiAshamari, Omar WGarcía Rigo, AlbertoHernández Pajares, ManuelMinimal representations for majority games
http://hdl.handle.net/2117/86215
Minimal representations for majority games
Freixas Bosch, Josep; Molinero Albareda, Xavier; Roura Ferret, Salvador
This paper presents some new results about majority games. Isbell (1959) was the first to find a majority game without a minimum normalized representation; he needed 12 voters to construct such a game. Since then, it has been an open problem to find the minimum number of voters of a majority game without a minimum normalized representation. Our main new results are: 1. All majority games with less than 9 voters have a minimum representation. 2. For 9 voters there are 14 majority games without a minimum integer representation, but these games admit a minimal normalized integer representation. 3. For 10 voters exist majority games with neither a minimum integer representation nor a minimal normalized integer representation.
Wed, 27 Apr 2016 07:22:54 GMThttp://hdl.handle.net/2117/862152016-04-27T07:22:54ZFreixas Bosch, JosepMolinero Albareda, XavierRoura Ferret, SalvadorThis paper presents some new results about majority games. Isbell (1959) was the first to find a majority game without a minimum normalized representation; he needed 12 voters to construct such a game. Since then, it has been an open problem to find the minimum number of voters of a majority game without a minimum normalized representation. Our main new results are: 1. All majority games with less than 9 voters have a minimum representation. 2. For 9 voters there are 14 majority games without a minimum integer representation, but these games admit a minimal normalized integer representation. 3. For 10 voters exist majority games with neither a minimum integer representation nor a minimal normalized integer representation.