Results 31 to 40 of about 305,530 (267)
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
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
The local vertex anti-magic coloring for certain graph operations
HeliyonThis work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
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
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
Complete multipartite graphs of non-QE class
Electronic Journal of Graph Theory and Applications, 2023 We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in Euclidean spaces.
Nobuaki Obata
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
Research of NP-Complete Problems in the Class of Prefractal Graphs
Mathematics, 2021 NP-complete problems in graphs, such as enumeration and the selection of subgraphs with given characteristics, become especially relevant for large graphs and networks.
Rasul Kochkarov
doaj +1 more source
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
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source