Results 31 to 40 of about 3,489,698 (302)
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
Journal of Mathematics, 2022 In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
Domination and Independent Domination in Extended Supergrid Graphs
Algorithms, 2022 Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph
Jong-Shin Chen +3 more
doaj +1 more source
On vertex stability of complete k-partite graphs [PDF]
Opuscula Mathematica, 2015 Let \(H\) be any graph. We say that graph \(G\) is \(H\)-stable if \(G-u\) contains a subgraph isomorphic to \(H\) for an arbitrary chosen \(u\in V(G)\).
Mateusz Nikodem
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
Decomposition of Cartesian product of complete graphs into paths and stars with four edges [PDF]
, 2021 summary:Let $P_k$ and $S_k$ denote a path and a star, respectively, on $k$ vertices. We give necessary and sufficient conditions for the existence of a complete $\{P_5,S_5\}$-decomposition of Cartesian product of complete ...
Ezhilarasi, Arockiajeyaraj P. +1 more
core +1 more source
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
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
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
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
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