Exploració per tema "Bipartite graphs"
Ara es mostren els items 1-12 de 12
-
Algebraic characterizations of bipartite distance-regular graphs
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertBipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—eigenvalues of its adjacency matrix—are symmetric about zero, as the corresponding eigenvectors come into pairs. Moreover, ... -
Constructions of small regular bipartite graphs of girth 6
(2011-03)
Article
Accés restringit per política de l'editorialIn this article, some structures in the projective plane of order q are found which allow us to construct small k - regular balanced bipartite graphs of girth 6 for all k ≤ q. When k = q, the order of these q-regular ... -
Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices
(2008-11)
Article
Accés obertLet q be a prime power and r=0,1...,q−3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices ... -
Large Edge-non-vulnerable Graphs
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertIn this paper we study the graphs such that the deletion of any edge does not increase the diameter. We give some upper bounds for the order of such a graph with given maximum degree and diameter. On the other hand ... -
LD-graphs and global location-domination in bipartite graphs
(2014-09-02)
Article
Accés restringit per política de l'editorialA dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum ... -
On the existence of combinatorial configurations
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertA (v, b, r, k) combinatorial configuration can be defined as a connected, (r, k)-biregular bipartite graph with v vertices on one side and b vertices on the other and with no cycle of length 4. Combinatorial configurations ... -
Online matching in regular bipartite graphs with randomized adversary
(Springer, 2018-08)
Capítol de llibre
Accés restringit per política de l'editorial -
Rainbow matchings in Dirac bipartite graphs
(2019-01-15)
Article
Accés obertWe show the existence of rainbow perfect matchings in µn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small µ¿>¿0. As an application of our results, we obtain several results on the existence of ... -
Small regular graphs of girth 7
(2015-07-01)
Article
Accés obertIn this paper, we construct new infinite families of regular graphs of girth 7 of smallest order known so far. Our constructions are based on combinatorial and geometric properties of (q + 1, 8)-cages, for q a prime power. ... -
Subdivisions in a bipartite graph
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertGiven a bipartite graph G with m and n vertices, respectively,in its vertices classes, and given two integers s, t such that 2 ≤ s ≤ t, 0 ≤ m−s ≤ n−t, and m+n ≤ 2s+t−1, we prove that if G has at least mn−(2(m−s)+n−t) edges ... -
The degree/diameter problem in maximal planar bipartite graphs
(2016)
Article
Accés obertThe (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar ... -
Vertex-disjoint cycles in bipartite tournaments
(2016-10)
Article
Accés obertLet k=2 be an integer. Bermond and Thomassen conjectured that every digraph with minimum out-degree at least 2k-1 contains k vertex-disjoint cycles. Recently Bai, Li and Li proved this conjecture for bipartite digraphs. ...
