Results 11 to 20 of about 305,530 (267)
Ultrametrics and Complete Multipartite Graphs
Theory and Applications of Graphs, 2022 Let \((X, d)\) be a semimetric space and let \(G\) be a graph. We say that \(G\) is the diametrical graph of \((X, d)\) if \(X\) is the vertex set of \(G\) and the adjacency of vertices \(x\) and \(y\) is equivalent to the equality \(\diam X = d(x, y)\).
Viktoriia Viktorivna Bilet +2 more
doaj +1 more source
Factorizations of complete graphs into tadpoles
AKCE International Journal of Graphs and Combinatorics, 2020 A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing a terminal vertex of the path to an arbitrary vertex of the cycle.
Michael Kubesa, Tom Raiman
doaj +1 more source
Treewidth of the Line Graph of a Complete Graph [PDF]
Journal of Graph Theory, 2014 AbstractIn recent articles by Grohe and Marx, the treewidth of the line graph of a complete graph is a critical example—in a certain sense, every graph with large treewidth “contains” . However, the treewidth of was not determined exactly. We determine the exact treewidth of the line graph of a complete graph.
Daniel J. Harvey, David R. Wood
openaire +2 more sources
On the ranks of configurations on the complete graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We consider the parameter rank introduced for graph configurations by M. Baker and S. Norine. We focus on complete graphs and obtain an efficient algorithm to determine the rank for these graphs.
Robert Cori, Yvan Le Borgne
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
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
doaj +1 more source
Computational graph completion
Research in the Mathematical Sciences, 2022 34 pages.
openaire +4 more sources
Seidel Integral Complete Split Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
On the bigenus of the complete graphs [PDF]
Australas. J Comb., 2021 We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These so-called biembeddings solve a generalization of the Earth-Moon problem for an infinite number of orientable surfaces.
openaire +3 more sources
On Group-Vertex-Magic Labeling of Simple Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let A be an Abelian group with identity 0. The A-vertex-magic labeling of a graph G is a mapping from the set of vertices in G to A-{0} such that the sum of the labels of every open neighborhood vertex of v is equal, for every vertex v in G.
Muhammad Husnul Khuluq +2 more
doaj +1 more source