Results 41 to 50 of about 3,489,698 (302)
The Thickness of the Complete Graph [PDF]
Canadian Journal of Mathematics, 1965 A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A
Beineke, L. W., Harary, Frank
openaire +2 more sources
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +3 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Decomposition of the completer-graph into completer-partiter-graphs
Graphs and Combinatorics, 1986 Let \(K_ r(n)\) be a complete r-partite hypergraph with n vertices. By \(f_ r(n)\) is denoted the minimal number q of pairwise edge-disjoint r- partite complete r-uniform hypergraphs which cover all edges of \(K_ r(n).\) In the paper is given an asymptotic value of the \(f_ r(n)\). For every fixed \(r\geq 1\) exist two positive numbers \(c_ 1(r)\) and \
openaire +2 more sources
Large-girth roots of graphs [PDF]
, 2009 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
On the bigenus of the complete graphs
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 +4 more sources
Dataflow graphs as complete causal graphs
2023 IEEE/ACM 2nd International Conference on AI Engineering – Software Engineering for AI (CAIN), 2023 Accepted to 2nd International Conference on AI Engineering - Software Engineering for AI (CAIN 23)
Andrei Paleyes +3 more
openaire +3 more sources
Coalition Graphs of Complete Bipartite Graphs
Academic Science JournalA coalition in a graph G= (V, E) consists of two disjoint, non-dominating vertex subsets whose union forms a dominating set, and a coalition graph is constructed from a coalition partition by representing each part as a vertex and connecting two parts ...
Rawaa Khalil Ibrahim
doaj +1 more source
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source