Results 21 to 30 of about 292,611 (264)
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
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
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
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
Intuitionistic Fuzzy Graphs with Categorical Properties
Fuzzy Information and Engineering, 2015 The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +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
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
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
Completely connected clustered graphs
Journal of Discrete Algorithms, 2003 A clustered graph \((G,T,r)\) consists of a graph \(G=(V,E)\), a tree \(T\), and an inner vertex \(r\) of \(T\) such that the set of leaves of \(T\) is exactly \(V\). A clustered graph is said to be completely connected if every cluster, and also each complement of a cluster, induces a connected subgraph.
Cornelsen, Sabine, Wagner, Dorothea
openaire +2 more sources
Nullity and Bounds to the Nullity of Dendrimer Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and star graphs.
Khidir Sharaf, Didar Ali
doaj +1 more source