A digraph H is infused in a digraph G if the vertices of H are mapped to vertices of G (not necessarily distinct), and the edges of H are mapped to edge-disjoint directed paths of G joining the corresponding pairs of vertices of G. The algorithmic problem of determining whether a fixed graph H can be infused in an input graph G is polynomial-time solvable for all graphs H (using paths instead o...

We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an R-labeling, implies the existence of the (non-homogeneous) cd-index, a key invariant for studying inequalities for the flag vector of polytopes. Mirroring Alexander duality for Eulerian po...

In this paper, we determine the Randić energy of m-splitting graph, m-shadow graph and m-duplicate a given m being an arbitrary integer. Our results allow construction infinite sequence graphs having same energy. Further, some invariants like degree Kirchhoff index, Kemeny’s constant number spanning trees special graphs. From our results, indicate how to obtain infinitely many pairs equienerget...

A digraph D is a 3-anti-circulant digraph, if for any four distinct vertices x1, x2, x3, x4 ∈ V (D), x1 → x2 ← x3 → x4 implies x4 → x1. In this paper, we characterize the structure of 3-anti-circulant digraphs containing a cycle factor and show that the structure is very close to semicomplete and semicomplete bipartite digraphs. Laborde et al. conjectured that every digraph has an independent s...

This paper is concerned with the dynamics evolution of opinions in the presence of both cooperations and antagonisms. The class of Laplacian flows is addressed through signed digraphs subject to switching topologies. Further, a state transition matrix-based approach is developed for the analysis of opinion dynamics, regardless of any assumptions on connectivity, structural balance or digon sign...

Berge’s strong path partition conjecture from 1982 generalizes and extends Dilworth’s theorem and the Greene–Kleitman theorem which are well known for partially ordered sets. The conjecture is known to be true for all digraphs only for k = 1 (by the Gallai–Milgram theorem) and for k ≥ λ (where λ is the cardinality of the longest path in the graph). The attempts made, so far, to prove the conjec...

It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No examples of such digraphs of diameter at least three are known, although several necessary conditions for their existence have been obtained. A particularly interesting necessary condition for the e...

Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any G. They studied polynomials greedoids associated with rooted graphs digraphs. proved that of digraphs have the multiplicative direct sum property. In addition, these are divisible by $$1 + z$$ under certain conditions. We compute all up to order six. A is said factorise if it has non-constant factor lower degree. s...

This paper deals with the design and analysis of dynamical systems on directed graphs (digraphs) that achieve weight-balanced and doubly stochastic assignments. Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of coordination problems, including formation control, agreement, and distributed optimization. We refer to a digraph as...