On girth-biregular graphs
نویسندگان
چکیده
Let Γ denote a finite, connected, simple graph. For an edge e of let n(e) the number girth cycles containing e. vertex v {e1, e2, …, ek} be set edges incident to ordered such that n(e1) ≤ n(e2) … n(ek). Then (n(e1),n(e2),…,n(ek)) is called signature v. The graph said girth-biregular if it bipartite, and all its vertices belonging same bipartition have signature. with g = 2d signatures (a1,a2,…,ak1) (b1,b2,…,bk2), assume without loss generality k1 ≥ k2. Our first result {a1, a2, ak1} {b1, b2, bk2}. next upper bound ak1 M, where M (k1−1)⌊g/4⌋(k2−1)⌈g/4⌉. We describe graphs attaining equality. d 3 or 4 even they are incidence Steiner systems generalized polygons, respectively. Finally, we show when − ε for some non-negative integer < k2 1, then 0. Similar valid 3, 1 k2|̸ k1.
منابع مشابه
Biregular Cages of Girth Five
Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r+1, an ({r,m}; g)–cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from [M. Abreu, G. Araujo–Pardo, C. ...
متن کاملBounds on the order of biregular graphs with even girth at least 8
Let 2 ≤ r < m and g ≥ 4 even be three positive integers. A graph with a degree set {r,m}, girth g and minimum order is called a bi-regular cage or an ({r,m}; g)-cage, and its order is denoted by n({r,m}; g). In this paper we obtain constructive upper bounds on n({r,m}; g) for some values of r,m and even girth at least 8.
متن کاملA Note on Path Factors of (3,4)-Biregular Bipartite Graphs
A proper edge coloring of a graph G with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident with any vertex are consecutive. A bipartite graph is (3, 4)-biregular if all vertices in one part have degree 3 and all vertices in the other part have degree 4. Recently it was proved [J. Graph Theory 61 (2009), 88-97] that if such a graph G has a spanning subgraph...
متن کاملOn short cycle enumeration in biregular bipartite graphs
ABSTRACT. A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs where the degree of left vertices is a constant c+1 and that of the right ver...
متن کاملAntimagic Orientation of Biregular Bipartite Graphs
An antimagic labeling of a directed graph D with n vertices and m arcs is a bijection from the set of arcs of D to the integers {1, . . . ,m} such that all n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it. An undirected graph G is said to have an antimagic orientation i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2023
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2935.a7b