Results 31 to 40 of about 3,337,855 (342)
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula Mathematica, 2022 The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj +1 more source
Packing Smaller Graphs into a Graph
Discrete Mathematics, 1989 AbstractLet G be a graph.
Shin-ichi Tokunaga +2 more
openaire +2 more sources
Embedding Graphs into Embedded Graphs [PDF]
Algorithmica, 2020 A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire +4 more sources
Graph saturation in multipartite graphs [PDF]
Journal of Combinatorics, 2016 16 pages, 4 ...
Florian Pfender +3 more
openaire +3 more sources
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Discrete Mathematics, 1984 AbstractLet G be a graph with vertex-set V(G) and edge-set X(G). Let L(G) and T(G) denote the line graph and total graph of G. The middle graph M(G) of G is an intersection graph Ω(F) on the vertex-set V(G) of any graph G. Let F = V′(G) ∪ X(G) where V′(G) indicates the family of all one-point subsets of the set V(G), then M(G) = Ω(F).The quasi-total ...
D. V. S Sastry, B.Syam Prasad Raju
openaire +2 more sources
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017 This article proposes a class of dependencies for graphs, referred to as graph entity dependencies (GEDs). A GED is defined as a combination of a graph pattern and an attribute dependency. In a uniform format, GEDs can express graph functional dependencies with constant literals to catch inconsistencies, and keys ...
Fan, Wenfei, Lu, Ping
openaire +3 more sources
Graph equations for line graphs and total graphs
Discrete Mathematics, 1975 AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Slobodan K. Simi, Dragos M. Cvetkovi
openaire +1 more source
, 2013 In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories.
LIVI, LORENZO, RIZZI, Antonello
core +1 more source
Quadratic Embedding Constants of Graph Joins [PDF]
Graphs and Combinatorics 38 (2022), 161, 22 pages,, 2020 The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely
arxiv +1 more source
Quotient graphs for power graphs [PDF]
Rendiconti del Seminario Matematico della Università di Padova, 2017 In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G) of a finite group
BUBBOLONI, DANIELA +2 more
openaire +4 more sources