Results 31 to 40 of about 5,946 (233)

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

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

Unbalanced bipartite factorizations of complete bipartite graphs [PDF]

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

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

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

Decomposition of complete bipartite graphs into cycles and stars with four edges

AKCE International Journal of Graphs and Combinatorics, 2020
Let Ck, Sk denote a cycle, star with k edges and let Km,n denotes a complete bipartite graph with m and n vertices in the parts. In this paper, we obtain necessary and sufficient conditions for the existence of a decomposition of complete bipartite ...
M. Ilayaraja, A. Muthusamy
doaj   +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  

Annihilating Graph of Abelian Groups

پژوهش‌های ریاضی, 2021
In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj  

Minimum k-critical-bipartite graphs: the irregular case [PDF]

Opuscula Mathematica
We study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz, Agnieszka Görlich, Karol Suchan   +2 more
doaj   +1 more source