Results 41 to 50 of about 1,011,259 (278)
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs [PDF]
, 2019 We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every Delta-regular bipartite graph if Delta >= 53.
Liao, Chao +3 more
core +2 more sources
Inverses of Bipartite Graphs [PDF]
Combinatorica, 2017 Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to M bius functions of ...
Yang, Yujun, Ye, Dong
openaire +3 more sources
Role coloring bipartite graphs
Discrete Applied Mathematics, 2022 A k-role coloring of a graph G is an assignment of k colors to the vertices of G such that if any two vertices are assigned the same color, then their neighborhood are assigned the same set of colors. By definition, every graph on n vertices admits an n-role coloring.
Sukanya Pandey, Vibha Sahlot
openaire +5 more sources
Bounds for the Kirchhoff Index of Bipartite Graphs
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +1 more source
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
Ain Shams Engineering Journal, 2015 Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding ...
S. El-Serafi +2 more
doaj +1 more source
A Note on a Binary Relation Corresponding to a Bipartite Graph
ITM Web of Conferences, 2018 In this paper, we firstly define a binary relation corresponding to the bipartite graph and study its properties. We also establish a relationship between the independent sets of the bipartite graph and the definable sets of binary relations ...
Sarı Hatice Kübra, Kopuzlu Abdullah
doaj +1 more source
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source
International Journal of Computer Mathematics: Computer Systems Theory, 2020 Given a bipartite graph G = ( X , Y , E ) , the bipartite dot product representation of G is a function f : X ∪ Y → R k and a positive threshold t such that for any x ∈ X and y ∈ Y , x y ∈ E if and...
Bailey, Sean, Brown, David E.
openaire +4 more sources
Network Structure Personalized Recommendation Method Based on Social Tag and Historical Price Curve [PDF]
Jisuanji gongcheng, 2017 Social tag contains rich content of commodity and reflects user’s personal preference for commodity.Historical price curve of commodity impacts user’s purchase-tendency.Therefore,this paper proposes a personalized recommendation method based on social ...
LING Xiao’e
doaj +1 more source
Approximately counting independent sets in bipartite graphs via graph containers [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2021 By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs.
Matthew Jenssen +2 more
semanticscholar +1 more source