Results 21 to 30 of about 96,090 (258)
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
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +4 more sources
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
Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter [PDF]
Graphs and Combinatorics, 2017 The strong geodetic problem is a recent variation of the classical geodetic problem. For a graph G, its strong geodetic number sg(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Vesna Iršič
semanticscholar +1 more source
A Note on the Equitable Choosability of Complete Bipartite Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2018 In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a ...
Madelynn Chase +4 more
semanticscholar +1 more source
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source