Results 51 to 60 of about 174 (114)
The join of split graphs whose completely regular endomorphisms form a monoid
In this paper, completely regular endomorphisms of the join of split graphs are investigated. We give conditions under which all completely regular endomorphisms of the join of two split graphs form a monoid.
Hou Hailong, Song Yanhua, Gu Rui
doaj +1 more source
On the sandpile model of modified wheels II
We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of the dollar game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999), 25–45].
Raza Zahid +3 more
doaj +1 more source
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 the Clean Graph of Commutative Artinian Rings
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
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
Ideal‐Based Quasi Cozero Divisor Graph of a Commutative Ring
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
Existence and Classification of 3‐Regular Symmetric Graphs of Order 6pq With Distinct Primes p and q
A graph Σ is said symmetric if its automorphism group acts transitively on the set of its arc. Let p < q be two distinct prime integers. This paper demonstrates that connected 3‐regular symmetric graphs of order 6pq exist if and only if the pair (p, q) belongs to the set (5, 19), (19, 37), (37, 73), which up to isomorphism there are nine sporadic ones,
Mehdi Alaeiyan +3 more
wiley +1 more source
A framework unifying some bijections for graphs and its connection to Lawrence polytopes [PDF]
Let \(G\) be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of \(G\) is a finite abelian group whose cardinality equals the number of spanning trees of \(G\).
Ding, Changxin
core +1 more source
Enumerating Problems Concerning Endomorphisms of Double Vertex Wheel Graphs
We can define six classes of endomorphisms on a graph, and they always form a chain based on set inclusion. The concepts of endomorphism type and endomorphism spectrum were introduced by Böttcher and Knauer in 1992. They provided a systematic and organized approach to study endomorphisms of graphs.
Yu Li, Hailong Hou, Kaidi Xu, Huadong Su
wiley +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source

