Results 11 to 20 of about 397,867 (315)
Detecting Matching Blunders of Multi-Source Remote Sensing Images via Graph Theory
Sensors, 2020 Large radiometric and geometric distortion in multi-source images leads to fewer matching points with high matching blunder ratios, and global geometric relationship models between multi-sensor images are inexplicit.
Cailong Deng +3 more
doaj +1 more source
On Topological Indices for Swapped Networks Modeled by Optical Transpose Interconnection System
IEEE Access, 2020 The optical transpose interconnection system (OTIS) network has many application in architecture for parallel as well as in distributed network. The optical translate interconnection system utilizes a straightforward pair of lenslet clusters to execute a
Nida Zahra +2 more
doaj +1 more source
Isomorphic Factorisations. I: Complete Graphs [PDF]
Transactions of the American Mathematical Society, 1978 An isomorphic factorisation of the complete graphKp{K_p}is a partition of the lines ofKp{K_p}intotisomorphic spanning subgraphsG; we then writeG|KpG|{K_p}, andG∈Kp/tG \in {K_p}/t. If the set of graphsKp/t{K_p}/tis not empty, then of courset|p(p−1)/2t|p(p - 1)/2. Our principal purpose is to prove the converse.
Harary, Frank +2 more
openaire +2 more sources
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
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
Character degree graphs that are complete graphs [PDF]
Proceedings of the American Mathematical Society, 2006 Let \(G\) be a finite group and let \(\text{cd}(G)\) denote the different integers which occur as the degrees of the irreducible complex characters of \(G\). Let \(\Gamma(G)\) be the graph whose vertex set is \(\text{cd}(G)-\{1\}\). An edge joins two vertices represented by positive integers \(a\) and \(b\) if \(\gcd(a,b)>1\). The authors prove that if
M. Bianchi +3 more
openaire +4 more sources
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