Results 71 to 80 of about 27,993 (181)
On existence of noncritical vertices in digraphs
, 2013 Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then there exists a
Nenashev, G. V.
core +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
On Some Algorithmic and Structural Results on Flames
Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$.
L. Volkmann
doaj +1 more source
Minimum‐Peak‐Cost Flows Over Time
Networks, Volume 86, Issue 4, Page 389-401, December 2025.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
Random Threshold Digraphs [PDF]
The Electronic Journal of Combinatorics, 2014 This paper introduces a notion of a random threshold directed graph, extending the work of Reilly and Scheinerman in the undirected case and closely related to random Ferrers digraphs.We begin by presenting the main definition: $D$ is a threshold digraph provided we can find a pair of weighting functions $f,g:V(D)\to\mathbb{R}$ such that for distinct ...
Reilly, Elizabeth +2 more
openaire +2 more sources
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs [PDF]
, 2013 A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph $\widetilde{G}$ is a digraph obtained from a sequence of vertex complement operations on $G ...
Joeris, Benson +3 more
core
Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
, 2015 The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the size.
Van Pham, Trung
core +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