Results 11 to 20 of about 2,715,030 (252)
Covering a graph by complete bipartite graphs [PDF]
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, László Pyber
openaire +3 more sources
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs [PDF]
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 +2 more
doaj +2 more sources
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
Star metric dimension of complete, bipartite, complete bipartite and fan graphs
International Journal of Trends in Mathematics Education Research, 2022 One of the topics in graph theory that is interesting and developed continuously is metric dimension. It has some new variation concepts, such as star metric dimension.
Reni Umilasari +2 more
doaj +1 more source
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +1 more source
Constructions of new integral graph families
Electronic Journal of Graph Theory and Applications, 2021 We construct new families of integral graphs by considering complete products, unions and point identifications of complete graphs and complete bipartite graphs.
Thomas Gardemann, Katja Mönius
doaj +1 more source
Opuscula Mathematica, 2011 It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
doaj +1 more source
On Subgraphs of the Complete Bipartite Graph [PDF]
Canadian Mathematical Bulletin, 1964 G(n) denotes a graph of n vertices and Ḡ(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let Ck(G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k1where the minimum is over all graphs G(n).
Erdős, Pál, Moon, J. W.
openaire +2 more sources
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
Journal of Mathematics, 2022 In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
On the Pagenumber of Complete Bipartite Graphs
Journal of Combinatorial Theory, Series B, 1997 An embedding of a simple graph \(G\) into a book is a placing of the vertices of \(G\) along the spine of the book together with a placing of the edges on the pages such that there is no page with crossing edges. The pagenumber \(p(G)\) is the minimum of pages within which \(G\) can be book embedded. Let \(K_{m,n}\) be the complete bipartite graph. The
Hikoe Enomoto +2 more
openaire +1 more source