Results 71 to 80 of about 34,890 (227)
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, 2013 To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +1 more source
Lyapunov‐Based Control of Circular Robot Formations With Limited Field of View
Artificial Intelligence for Engineering, Volume 1, Issue 2, Page 83-94, 29 December 2025.A nonlinear vision‐based control framework ensures safe leader–follower formation of wheeled mobile robots under limited camera field‐of‐view. The Lyapunov‐based controller guarantees persistent visibility, prescribed‐time convergence, and uniform circular formation, validated through real‐time experiments on Quanser QBot platforms. ABSTRACT This paper
Nidhi Agarwal +6 more
wiley +1 more source
Vertices with the second neighborhood property in Eulerian digraphs [PDF]
Opuscula Mathematica, 2019 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Michael Cary
doaj +1 more source
Journal of Combinatorial Mathematics and Combinatorial ComputingA ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph.
openaire +2 more sources
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v,w ∈ V (D), (u, v), (v,w) ∈ A(D) implies that (u,w) ∈ A(D).
Hernández-Cruz César
doaj +1 more source
That's Not What I Was Promised! Psychological Contracts and Quiet Quitting
Human Resource Management, Volume 64, Issue 6, Page 1833-1863, November/December 2025.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
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +1 more source
A new sufficient condition for a 2-strong digraph to be Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least $n-
Samvel Kh. Darbinyan
doaj +1 more source
On Single Valued Neutrosophic Signed Digraph and its applications [PDF]
Neutrosophic Sets and Systems, 2018 The development of the theory of the single valued neutrosophic (SVN) digraph is done in this paper. Also this paper introduces the concept of SVN signed digraph.
K. Sinha, P. Majumdar
doaj +1 more source