Results 31 to 40 of about 10,299 (219)

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, R. El-Shanawany, H. Shabana   +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, Costas Iliopoulos, Mirka Miller   +2 more
doaj   +1 more source

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

Journal 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, Omar Bazighifan, S. S. Askar   +2 more
doaj   +1 more source

Decycling bipartite graphs

Journal 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

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

Decomposition of complete graphs into small graphs [PDF]

Opuscula Mathematica, 2010
In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj   +1 more source

Bipartite embedding of (p,q)-trees [PDF]

Opuscula Mathematica, 2006
A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-tree if \(|E(G)|=p+q-1\) and \(G\) has no cycles. A bipartite graph \(G=(L,R;E)\) is a subgraph of a bipartite graph \(H=(L',R';E')\) if \(L\subseteq L'\)
Beata Orchel
doaj  

The Median Problem on k-Partite Graphs

Discussiones Mathematicae Graph Theory, 2015
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G.
Pravas Karuvachery, Vijayakumar Ambat
doaj   +1 more source