Results 121 to 130 of about 3,655 (289)
Embracing Complexity in HRM Research: A Call for System and Process Perspectives
Human Resource Management, EarlyView.ABSTRACT Human resource management (HRM) is inherently complex. It involves systems of principles, practices, and activities operating at individual, group, organizational, and macro levels, which are interlinked through complex processes. Yet, empirical research has not kept pace with this conceptual richness.
Rebecca Hewett, Madleen Meier‐Barthold
wiley +1 more source
The class groups of arithmetically equivalent Algebras /
, 1996 Two number fields having the same Dedekind Zeta function need not have isomorphic class groups. However, the p-parts of these class group are isomorphic except possibly for a finite number of exceptional primes p.
Arsenault, Nicolas.
core
Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique
, 2002 The main purpose of this paper is to give a method for construction of the reduced reachability graph for Stochastic Petri Nets (SPN), the symbolic graph. This construction is achieved by exploiting the structural symetries in the net using the theory of
A. Aissani, M. Ioualalen
core +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Common cause versus dynamic mutualism: Insights into ADHD's common comorbidities
JCPP Advances, EarlyView.Abstract Background Contemporary classification systems differ in their conceptualization of ADHD as either an externalizing or neurodevelopmental condition, with both perspectives promoting the common cause model as an explanation of ADHD's comorbidity.
Zheyue Peng, Ashley L. Watts
wiley +1 more source
This study is the $3^{rd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 2. Here, we obtain all the 384 pairs of Type-2 isomorphic circulant graphs of order 32.
openaire +2 more sources
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
This study is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 3. Here, we study Type-2 isomorphic circulant graphs of order 54 and show that there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant ...
openaire +2 more sources
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Universal third parts of any complete 2-graph and none of DK5
Tyt. z nagłówka.Bibliogr. s. 695-696.It is shown that there is no digraph F which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to F for each choice of the remainder.
Fortuna, Artur
core