Results 41 to 50 of about 1,357 (88)
Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer
Open 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
Veterinary 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
On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
Open Mathematics, 2022 A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj +1 more source
Beck's Conjecture for Power Graphs [PDF]
, 2014 Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core
On the Clean Graph of Commutative Artinian Rings
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.For a commutative Artinian ring R with unity, the clean graph Cl(R) is a graph with vertices in the form of an ordered pair (e, u), where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices (e, u) and (f, v) are adjacent in Cl(R) if and only if ef = fe = 0 or uv = vu = 1.
R. Singh +3 more
wiley +1 more source
The rigidity of a partially triangulated torus
Proceedings 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
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
Simplicial complexes defined on groups
Open MathematicsThis study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj +1 more source
Ideal‐Based Quasi Cozero Divisor Graph of a Commutative Ring
Journal of Mathematics, Volume 2025, Issue 1, 2025.Let R be a commutative ring with identity and I be an ideal of R. The zero‐divisor graph of R with respect to I, denoted by ΓI(R), is the graph whose vertices are the set {x ∈ R∖I |xy ∈ I for some y ∈ R∖I} with distinct vertices x and y are adjacent if and only if xy ∈ I.
Faranak Farshadifar, Huadong Su
wiley +1 more source
2-closures of primitive permutation groups of holomorph type
Open Mathematics, 2019 The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj +1 more source