Results 21 to 30 of about 423,962 (267)
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Sethuraman 0001, P. Selvaraju
openaire +2 more sources
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
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]
Engineering and Technology Journal, 2013 This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab +2 more
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
The Coloring Graph of Complete Graphs
The PUMP Journal of Undergraduate Research, 2019 We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.
openaire +2 more sources
The distance magic property and two families of Cartesian product graphs
Electronic Journal of Graph Theory and ApplicationsLet G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V.
Patrick Thomas Headley
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
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
CoRR, 2014 The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Candès and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large.
Vassilis Kalofolias +3 more
openaire +2 more sources