Results 71 to 80 of about 1,092 (193)
A new Bartholdi zeta function of a digraph
We introduce a new type of the Bartholdi zeta function of a digraph D, and give a determinant expression of it. Furthermore, we define a new type of the Bartholdi L-function of D, and give a determinant expression of it.
Mizuno, Hirobumi, Sato, Iwao
core +1 more source
Minimum‐Peak‐Cost Flows Over Time
ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska +7 more
wiley +1 more source
That's Not What I Was Promised! Psychological Contracts and Quiet Quitting
ABSTRACT The phrase “quiet quitting” has become a popular topic within the workplace and academia. However, the nomological network of quiet quitting is unclear. We contribute to quiet quitting research by incorporating organizational justice and job characteristics theories with a psychological contract and social exchange lens to illuminate ...
Truit W. Gray +3 more
wiley +1 more source
Finite digraphs with given regular automorphism groups
We prove that, given an infinite group G there is a directed graph X such that its automorphism group A(X) is the regular representation of G. The proof uses combinatorial set theoretic arguments (Erdös-Rado partition calculus). One of the lemmas asserts that, if |G|>2κ then G contains a subset H of power κ+ satisfying x−1y=y−1z⇒x=z (x, y, z ∈ H ...
openaire +3 more sources
Suborbit Structure of Permutation p-Groups and an Application to Cayley Digraph Isomorphism
Let P be a transitive permutation group of order pm, p an odd prime, containing a regular cyclic subgroup. The main result of this paper is a determination of the suborbits of P.
Shaofei Du, Brian Alspach
core +1 more source
Elusive groups of automorphisms of digraphs of small valency
A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.
Michael Giudici +3 more
openaire +3 more sources
THE DIGRAPH OF THE SQUARE MAPPING ON QUOTIENT RINGS OVER THE GAUSSIAN INTEGERS
In this work, we investigate the structure of the digraph [Formula: see text] associated with the square mapping on the ring of Gaussian integers by using the exponent of the unit group modulo γ.
NAWAPHON MAINGAM, YOTSANAN MEEMARK
core +1 more source
Circulant digraph isomorphisms
We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two ...
Cancela, Elias Damian, Cancela, Elias
core
The quadratic digraph on polynomial rings over finite fields
This work is based on ideas of Somer and of Křížek on the structure of digraphs associated with quadratic congruence modulo n. We study the quadratic digraph whose vertex set Vf is the quotient ring A/fA and edge set is given by Ef(2)={(g¯,g¯2):g¯∈A/fA},
Nathakhun Wiroonsri +3 more
core +1 more source
Process and operator performance analysis in process operational safety [PDF]
Abnormal operation of chemical processec sa used by equipment and sensor faults, such as plugging of pipes, control system failure or improper operation by personnel can result in poor product quality, equipment damage, or a catastrophe process failure ...
Sezalli, Yussef Haji Ali Mirza
core

