Some properties of semiregular cages

Autor: Camino Balbuena, Xavier Marcote, Diego Gonzalez-Moreno

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 5, Iss Graph and Algorithms (2010)

Graphs and Algorithms

Externí odkaz: https://doaj.org/article/66bbafa3e75b40eb952e4a9b96ba1a92

Extremal K_(s,t)-free bipartite graphs

Autor: Camino Balbuena, P. García-Vázquez, Xavier Marcote, J. C. Valenzuela

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 3, Iss Graph and Algorithms (2008)

Graphs and Algorithms

Externí odkaz: https://doaj.org/article/9bb51aecd95d44819abdd7ac4ccb15e8

Elliptic semiplanes and regular graphs with girth 5

Autor: Manuel Bendala, Camino Balbuena, Encarnación Abajo

Publikováno v: Electronic Notes in Discrete Mathematics. 68:245-250

A (k, g)-graph is a k-regular graph with girth g and a (k, g)-cage is a (k, g)-graph with the fewest possible number of vertices. The cage problem consists of constructing (k, g)-graphs of minimum order n(k, g). We focus on girth g = 5 , where cages

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f13289bed68955355b45324fc76bf49a
https://doi.org/10.1016/j.endm.2018.06.042

Characterizing identifying codes from the spectrum of a graph or digraph

Autor: Cristina Dalfó, Berenice Martínez-Barona, Camino Balbuena

Publikováno v: Linear Algebra and its Applications
Repositorio Abierto de la UdL
Universitad de Lleida
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

A (1, ≤ ℓ)-identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most ℓ have distinct closed in-neighborhoods within C. As far as we know, it is the very fir

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d6c97b30fbf05a3d5f59ed1da7e89ad

Identifying codes in line digraphs

Autor: Berenice Martínez-Barona, Camino Balbuena, Cristina Dalfó

Publikováno v: Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Applied Mathematics and Computation
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Given an integer ≥1, a (1, ≤ )-identifying code in a digraph is a dominating subset C of vertices such that all distinct subsets of vertices of cardinality at most have distinct closed in-neighborhoods within C . In this paper, we prove that ever

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::117a53a70bc49417c4e9f4dcedc22d51