Results 191 to 200 of about 5,946 (233)

Detection of a core-periphery structure in bipartite user-content networks based on modularity and Stochastic Block Model. [PDF]

J Appl Stat
Federico L, De Giovanni L, Chessa A, D'Urso P.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph

Graphs and Combinatorics, 1999
It is proved that if \(G=(X,Y;E)\) is a bipartite graph with \(|X|=|Y|=4s\), \(s\geq 2\), and the minimum degree of \(G\) is at least \(4s-3\), then \(G\) contains four vertex-disjoint copies of \(K_{s,s}\).
Hong Wang
exaly   +2 more sources

Paintability of Complete Bipartite Graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Decomposition of Graphs into Complete Bipartite Graphs

Graphs and Combinatorics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinquan Dong, Yanpei Liu
openaire   +2 more sources

Complete (2,2) Bipartite Graphs

Malaysian Journal of Mathematical Sciences, 2022
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire   +1 more source

Packings by Complete Bipartite Graphs

SIAM Journal on Algebraic Discrete Methods, 1986
Summary: Given any set \({\mathcal B}\) of complete bipartite graphs, we ask whether a graph H admits a \({\mathcal B}\)-factor, i.e., a spanning subgraph, each of whose components is a member of \({\mathcal B}\). More generally, we seek in H a maximum \({\mathcal B}\)-packing, i.e., a \({\mathcal B}\)-factor of a maximum size subgraph of H.
Hell, P., Kirkpatrick, D. G.
openaire   +1 more source

Pagenumber of complete bipartite graphs

Journal of Graph Theory, 1988
AbstractGiven an ordering of the vertices of a graph around a circle, a page is a collection of edges forming noncrossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. Thepagenumber t(G)(also called book thickness) is the minimum number of pages in a book embedding of G. We present
Douglas J. Muder, Margaret Lefevre Weaver, Douglas B. West   +2 more
openaire   +2 more sources

The Coarseness of the Complete Bipartite Graph

Canadian Journal of Mathematics, 1969
The coarseness, c(G), of a graph G is the maximum number of edge-disjoint, non-planar graphs whose union is G. The coarseness of the complete graph has been investigated elsewhere (1; 2). We consider the coarseness of the complete bipartite, or 2-coloured, graph, Km,n, consisting of sets of mand nvertices, each member of one set being joined by an edge
Beineke, L. W., Guy, R. K.
openaire   +2 more sources