Results 1 to 10 of about 143,400 (232)
Generalized Turán Problems for Complete Bipartite Graphs
Graphs and Combinatorics, 2022 For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.
Dániel Gerbner, Balázs Patkós
semanticscholar +4 more sources
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +4 more sources
Packing Trees in Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H).
Wang Jieyan
doaj +2 more sources
Weak saturation numbers of complete bipartite graphs in the clique [PDF]
Journal of Combinatorial Theory, 2020 The notion of weak saturation was introduced by Bollobas in 1968. Let $F$ and $H$ be graphs. A spanning subgraph $G \subseteq F$ is weakly $(F,H)$-saturated if it contains no copy of $H$ but there exists an ordering $e_1,\ldots,e_t$ of $E(F)\setminus E(G)
Gal Kronenberg +2 more
semanticscholar +1 more source
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
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2019 Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain tree.
Jun Ge, F. Dong
semanticscholar +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
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