Results 21 to 30 of about 472 (183)
Algebra and Logic, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, W. +3 more
openaire +2 more sources
Orthogonal colourings of Cayley graphs [PDF]
Discrete Mathematics, 2020 Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of Cayley graphs are discussed.
Jeannette C. M. Janssen, Kyle MacKeigan
openaire +3 more sources
Brief survey on divisor graphs and divisor function graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Number theoretic graphs are one of the emerging fields in Graph theory. This article is a study on existing research results on Number theoretic graphs, especially on Divisor Graphs [Formula: see text], Divisor Function Graphs (DFGs) and Divisor Cayley ...
Vignesh Ravi, Kalyani Desikan
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2016 Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
Deepa Sinha, Deepakshi Sharma
openaire +1 more source
Open Mathematics, 2020 A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
The Scientific World Journal, 2013 We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures.
Noura O. Alshehri, Muhammad Akram
doaj +1 more source
Cayley and Tutte polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs.
Matjaž Konvalinka, Igor Pak
doaj +1 more source
Improved Expansion of Random Cayley Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the ...
Po-Shen Loh, Leonard J. Schulman
doaj +2 more sources