Results 81 to 90 of about 10,299 (219)
Sidorenko's conjecture for blow-ups
Discrete Analysis, 2021 Sidorenko's conjecture for blow-ups, Discrete Analysis 2021:2, 13 pp. Let $G$ be a bipartite graph with finite vertex sets $X$ and $Y$. If $G$ has density $\alpha$, then the average degree of the vertices in $X$ is $\alpha|Y|$, so the mean-square degree
David Conlon, Joonkyung Lee
doaj +1 more source
Discrete Mathematics, 2000 The authors study coverings of non-bipartite graphs by bipartite graphs. In particular, they enumerate regular bipartite coverings for orders which are twice a prime.
Archdeacon, D +3 more
openaire +2 more sources
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources
Using random walks to generate associations between objects.
PLoS ONE, 2014 Measuring similarities between objects based on their attributes has been an important problem in many disciplines. Object-attribute associations can be depicted as links on a bipartite graph.
Muhammed A Yildirim, Michele Coscia
doaj +1 more source
Adaptive Bipartite Consensus of Second-Order Multi-Agent Systems With Bounded Disturbances
IEEE Access, 2020 This paper investigates distributed adaptive bipartite consensus for second-order multi-agent systems (MASs) with bounded disturbances under a signed graph. Based on adaptive variable structure control strategies, an adaptive bipartite consensus protocol
Haichuan Xu +3 more
doaj +1 more source
Hitting Times in the Binomial Random Graph
Journal of Graph Theory, EarlyView.ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet +2 more
wiley +1 more source
The enumeration of bipartite graphs
Discrete Mathematics, 1979 AbstractThe standard construction of graphs with n connected components is modified here for bicolored graphs by letting Sn × H act on the function space Y∗where X={1,2,…,n}, Y is the set of connected bicolored graphs, and H is the group that interchanges the vertex colors.
openaire +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source