Results 21 to 30 of about 617,805 (269)

Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]

open access: yes, 2013
This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core   +1 more source

Random Generation and Enumeration of Bipartite Permutation Graphs [PDF]

open access: yes, 2011
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given.
Yota Otachi   +7 more
core   +1 more source

On bipartite powers of bigraphs [PDF]

open access: yes, 2012
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper、 we investigate abipartite analogue of graph powers、 which we call bipartite powers of bigraphs.
Yota Otachi   +5 more
core   +1 more source

Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-Bipartite Network Bi-Egonet

open access: yesIEEE Access, 2019
Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang   +4 more
doaj   +1 more source

Bounds for the Kirchhoff Index of Bipartite Graphs

open access: yesJournal 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

open access: yesAin 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

open access: yesITM 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

open access: yesElectronic 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

A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes

open access: yesJournal of Function Spaces, 2022
Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady   +2 more
doaj   +1 more source

Decycling bipartite graphs

open access: yesJournal of Graph Algorithms and Applications, 2021
Let $G=(V,E)$ be a graph and let $S\subseteq V$ be a subset of its vertices. If the subgraph of $G$ induced by $V\setminus S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling number of $G$. Determining the decycling number of a graph $G$ is NP-hard, even if $G$ is bipartite.
openaire   +3 more sources

Home - About - Disclaimer - Privacy