Results 21 to 30 of about 3,369,792 (260)
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
Monochromatic triangles in three-coloured graphs [PDF]
, 2013 In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2-coloured. Goodman (1985) [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured ...
Král', D. +16 more
core +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +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
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Sethuraman 0001, P. Selvaraju
openaire +2 more sources
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
On Order Prime Divisor Graphs of Finite Groups
Discussiones Mathematicae - General Algebra and Applications, 2021 The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
GCD-graphs and NEPS of complete graphs
Ars Mathematica Contemporanea, 2012 A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. Such graphs are known to have integral spectrum. A non-complete extended p-sum, or NEPS in short, is well-known general graph product. We show that the class of gcd-graphs and the class of NEPS of complete graphs coincide.
Klotz, Walter, Sander, Torsten
openaire +3 more sources
MathematicsThe half-sunlet graph HS3k is a 2k-cycle with a pendant edge at every alternate vertex (|V|=|E|=3k). We give a complete decomposition theory for HS12 (k=4), characterising when HS12 decomposes G for G complete, complete bipartite, and complete tripartite.
Gajendran Palaniyandi +2 more
doaj +1 more source
A Note on the Geometry of Closed Loops
Mathematics, 2023 In this paper, we utilize the Ramsey theory to investigate the geometrical characteristics of closed contours. We begin by examining a set of six points arranged on a closed contour and connected as a complete graph. We assign the downward-pointing edges
Nir Shvalb +3 more
doaj +1 more source