Results 41 to 50 of about 1,461 (103)

A group sum inequality and its application to power graphs [PDF]

open access: yes, 2014
Let $G$ be a finite group of order $n$, and let $C_n$ be the cyclic group of order $n$. We show that $\sum_{g \in C_n} \phi(\mathrm{o}(g))\geq \sum_{g \in G} \phi(\mathrm{o}(g))$, with equality if and only if $G$ is isomorphic to $C_n$. As an application,
Curtin, Brian, Pourgholi, Gholam Reza
core   +1 more source

Some new results on the join graph of given groups

open access: yesMathematica, 2018
Recently, H. Ahmadi et al. defined the join graph associated to a finite group. They studied this graph not only on graph theoretic points, but also on group theoretic cases.
A. Asrari, B. Tolue
semanticscholar   +1 more source

Burnside Chromatic Polynomials of Group-Invariant Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
doaj   +1 more source

Nauty in Macaulay2

open access: yes, 2011
We introduce a new Macaulay2 package, Nauty, which gives access to powerful methods on graphs provided by the software nauty by Brendan McKay. The primary motivation for accessing nauty is to determine if two graphs are isomorphic.
Cook II, David
core   +1 more source

Laplacian spectrum of comaximal graph of the ring ℤn

open access: yesSpecial Matrices, 2022
In this paper, we study the interplay between the structural and spectral properties of the comaximal graph Γ(Zn)\Gamma \left({{\mathbb{Z}}}_{n}) of the ring Zn{{\mathbb{Z}}}_{n} for n>2n\gt 2.
Banerjee Subarsha
doaj   +1 more source

An extension of total graph over a module

open access: yes, 2017
Let R be a commutative ring with nonzero identity and U.R/ its multiplicative group of units. Let M be an R-module where the collection of prime submodules is non-empty and let N be an arbitrary union of prime submodules. Also, suppose that c 2 U.R/ such
Ahmad Abassi, A. Ramin
semanticscholar   +1 more source

The rigidity of a partially triangulated torus

open access: yesProceedings of the London Mathematical Society, Volume 118, Issue 5, Page 1277-1304, May 2019., 2019
Abstract A simple graph is 3‐rigid if its generic embeddings in R3 are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal 3‐rigidity of a simple graph obtained from a triangulated torus by the deletion of edges interior to an embedded triangulated disc.
J. Cruickshank, D. Kitson, S. C. Power
wiley   +1 more source

Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer

open access: yesOpen Mathematics, 2019
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex ...
Liu Hailin
doaj   +1 more source

Efficacy and field safety of ilunocitinib for the control of atopic dermatitis in client‐owned dogs: A multicentre, double‐masked, randomised, placebo‐controlled clinical trial

open access: yesVeterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.
Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster   +5 more
wiley   +1 more source

A CLASSIFICATION OF RAMANUJAN COMPLEMENTS OF UNITARY CAYLEY GRAPHS

open access: yes, 2017
The unitary Cayley graph on n vertices, Xn, has vertex set Zn, where two vertices a and b are connected by an edge if and only if they differ by a multiplicative unit modulo n, i.e. gcd(ab, n) = 1. A k-regular graph X is Ramanujan if and only if λ(X) ≤ 2
R. Safakish, S. Mehry
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy