Results 21 to 30 of about 5,409,269 (206)
Complete graph immersions and minimum degree [PDF]
Journal of Graph Theory, 2015 An immersion of a graph H in another graph G is a one‐to‐one mapping ϕ:V(H)→V(G) and a collection of edge‐disjoint paths in G, one for each edge of H, such that the path Puv corresponding to the edge uv has endpoints ϕ(u) and ϕ(v) .
Zdenek Dvorák, Liana Yepremyan
semanticscholar +1 more source
The 6-girth-thickness of the complete graph
AKCE International Journal of Graphs and Combinatorics, 2020 The g-girth-thickness of a graph G is the minimum number of planar subgraphs of girth at least g whose union is G. In this paper, we determine the 6-girth-thickness of the complete graph Kn in almost all cases.
Héctor Castañeda-López +4 more
doaj +1 more source
Multi-Scale Spatial Temporal Graph Convolutional Network for Skeleton-Based Action Recognition [PDF]
AAAI Conference on Artificial Intelligence, 2021 Graph convolutional networks have been widely used for skeleton-based action recognition due to their excellent modeling ability of non-Euclidean data. As the graph convolution is a local operation, it can only utilize the short-range joint dependencies ...
Zhan Chen +4 more
semanticscholar +1 more source
On the Semigroup Whose Elements Are Subgraphs of a Complete Graph
Mathematics, 2018 Let K n be a complete graph on n vertices. Denote by S K n the set of all subgraphs of K n . For each G , H ∈ S K n , the ring sum of G and H is a graph whose vertex set is V ( G ) ∪ V ( H ) and whose edges are ...
Yanisa Chaiya +3 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2021 Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj +1 more source
When Is a Graded Free Complex Exact?
Mathematics, 2022 Minimal free resolutions of a finitely generated module over a polynomial ring S=k[x], with variables x={x1,…,xn} and a field k have been extensively studied.
David C. Molano +2 more
doaj +1 more source
Symmetry, 2017 This paper clarifies the hierarchical structure of the sharp constants for the discrete Sobolev inequality on a weighted complete graph. To this end, we introduce a generalized-graph Laplacian A = I − B on the graph, and investigate two types ...
Kazuo Takemura, Y. Kametaka, A. Nagai
semanticscholar +1 more source
On Triangle‐Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph [PDF]
Journal of Graph Theory, 2014 We prove a decomposition theorem for the class of triangle‐free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least five in this class is 3‐colorable.
Nicolas Trotignon, Kristina Vuskovic
semanticscholar +1 more source
Simple-intersection graphs of rings
AIMS Mathematics, 2023 Let R be a ring with unity. In this paper, we introduce a new graph associated with R called the simple-intersection graph of R, denoted by GS(R). The vertices of GS(R) are the nonzero ideals of R, and two vertices are adjacent if and only if their ...
Fida Moh'd, Mamoon Ahmed
doaj +1 more source
One-factorizations of the complete graph $K_{p+1}$ arising from parabolas
Theory and Applications of Graphs, 2022 There are three types of affine regular polygons in AG(2, q): ellipse, hyperbola and parabola. The first two cases have been investigated in previous papers.
György Kiss +2 more
doaj +1 more source