Results 41 to 50 of about 2,876,957 (249)

Complete bipartite factorisations by complete bipartite graphs

Discrete Mathematics, 1997
Let \(K_{m,n}\) be the complete bipartite graph on sets of size \(m\) and \(n\). A \(K_{p,q}\)-factor of \(K_{m,n}\) is a spanning subgraph of \(K_{m,n}\) which is a union of vertex-disjoint subgraphs each isomorphic to \(K_{p,q}\). If \(K_{m,n}\) is expressed as a edge-disjoint union of \(K_{p,q}\)-factors, then this union is called a \(K_{p,q ...
openaire   +1 more source

A note on pm-compact bipartite graphs

Discussiones Mathematicae Graph Theory, 2014
A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj   +1 more source

Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach

Journal of Function Spaces, 2022
For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science.
A. El-Mesady, Omar Bazighifan
doaj   +1 more source

ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]

Journal of Algebraic Systems
Recently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi, Sumanta Borah, Ankur Bharali   +2 more
doaj   +1 more source

Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Oleg Duginov
doaj   +1 more source

Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths

, 2016
Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, Kn,n or Kn,n−I , where I is a 1-factor of Kn,n , can be decomposed into cycles of distinct even lengths ...
Fu, Chin-Mei;Huang, Kuo-Ching;Mishima, Miwako
core   +1 more source

A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]

Transactions on Combinatorics, 2012
In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj  

Multi-view Clustering Based on Bipartite Graph Cross-view Graph Diffusion [PDF]

Jisuanji kexue
Multi-view clustering is an research hotspots in the field of unsupervised learning.Recently,the method based on cross-view graph diffusion uses the complementary information between multiple views to obtain a unified graph for clustering on the basis of
WANG Jinfu, WANG Siwei, LIANG Weixuan, YU Shengju, ZHU En
doaj   +1 more source

On vertex stability of complete k-partite graphs [PDF]

Opuscula Mathematica, 2015
Let \(H\) be any graph. We say that graph \(G\) is \(H\)-stable if \(G-u\) contains a subgraph isomorphic to \(H\) for an arbitrary chosen \(u\in V(G)\).
Mateusz Nikodem
doaj   +1 more source

Universal Rigidity of Complete Bipartite Graphs [PDF]

Discrete & Computational Geometry, 2017
DCG published ...
Robert Connelly, Steven J. Gortler
openaire   +2 more sources