Zobrazeno 1 - 5
of 5
pro vyhledávání: '"J. Fíbrega"'
Publikováno v:
Discrete Mathematics. 301:124-136
A regular graph G of degree @d and girth g is said to be a (@d,g)-cage if it has the least number of vertices among all @d-regular graphs with girth g. A graph is called k-connected if the order of every cutset is at least k. In this work, we prove t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c444aeac84f99bd15792f39c67b4d3d
https://doi.org/10.1016/j.disc.2004.11.026
https://doi.org/10.1016/j.disc.2004.11.026
Publikováno v:
Discrete Mathematics. 267(1-3):229-246
A maximally connected digraph is said to be superconnected if every minimum disconnecting set F of vertices is trivial, that is, it consists of the vertices adjacent to or from a given vertex not belonging to F. This work is devoted to presenting a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e744e5397b6d64cbd2c0f3759da6385e
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Jaume I
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral character
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba2ed25f53d76030496dce44f5ea4fe7
http://arxiv.org/abs/1212.3815
http://arxiv.org/abs/1212.3815
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2692d4f16508e3e355766926efcf3a0f
https://hdl.handle.net/10459.1/72557
https://hdl.handle.net/10459.1/72557
Publikováno v:
Discrete Applied Mathematics. (16):2053-2060
Given an integer k⩾1 and any graph G, the sequence graph Sk(G) is the graph whose set of vertices is the set of all walks of length k in G. Moreover, two vertices of Sk(G) are joined by an edge if and only if their corresponding walks are adjacent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::541d47469acd209d6def9417c235208d