Mostra el registre d'ítem simple
M-Matrix Inverse problem for distance-regular graphs
dc.contributor.author | Bendito Pérez, Enrique |
dc.contributor.author | Carmona Mejías, Ángeles |
dc.contributor.author | Encinas Bachiller, Andrés Marcos |
dc.contributor.author | Mitjana Riera, Margarida |
dc.date.accessioned | 2011-05-09T08:15:36Z |
dc.date.available | 2011-05-09T08:15:36Z |
dc.date.issued | 2011 |
dc.identifier.citation | Bendito Pérez, Enrique [et al.]. M-Matrix Inverse problem for distance-regular graphs. A: International Workshop on Optimal Networks Topologies. "Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010". Barcelona: Iniciativa Digital Politècnica, 2011, p. 107-120. |
dc.identifier.isbn | 978-84-7653-565-3 |
dc.identifier.uri | http://hdl.handle.net/2099/10367 |
dc.description.abstract | We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance–regular graph is a M–matrix;that is, it has non–positive off–diagonal elements or, equivalently when the Moore-Penrose inverse of the combinatorial Laplacian of a distance–regular graph is also the combinatorial Laplacian of another network. When this occurs we say that the distance–regular graph has the M–property. We prove that only distance–regular graphs with diameter up to three can have the M–property and we give a characterization of the graphs that satisfy the M-property in terms of their intersection array. Moreover we exhaustively analyze the strongly regular graphs having the M-property and we give some families of distance regular graphs with diameter three that satisfy the M-property. |
dc.format.extent | 14 p. |
dc.language.iso | eng |
dc.publisher | Iniciativa Digital Politècnica |
dc.relation.ispartof | International Workshop on Optimal Networks Topologies |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Matrix inversion |
dc.subject.lcsh | Laplacian operator |
dc.subject.lcsh | Graph theory |
dc.title | M-Matrix Inverse problem for distance-regular graphs |
dc.type | Conference report |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.lemac | Matrius (Matemàtica) |
dc.subject.lemac | Operadors diferencials |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
local.citation.author | Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida |
local.citation.contributor | International Workshop on Optimal Networks Topologies |
local.citation.pubplace | Barcelona |
local.citation.publicationName | Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010 |
local.citation.startingPage | 107 |
local.citation.endingPage | 120 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
3er. 2010 [27]
Facultat de Matemàtiques i Estadística, Universitat Politècnica de Catalunya, Barcelona, 9-11 June 2010