97 citations · 499 across the 139 of their papers we have counts for
129 papers · 1 filter
On the maximal sum of the entries of a matrix power
Sela Fried, Toufik Mansour
Let be the maximal sum of the entries of , where is a square matrix of size , consisting of the numbers , each appearing exactly once. We prove th…
Random Walk Labelings of Perfect Trees and Other Graphs
Sela Fried, Toufik Mansour
A Random walk labeling of a graph is any labeling of that could have been obtained by performing a random walk on . Continuing two recent works, we calculate the number…
Further Results on Random Walk Labelings
Sela Fried, Toufik Mansour
Recently, we initiated the study of random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex i…
Graph Labelings Obtainable by Random Walks
Sela Fried, Toufik Mansour
We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the…
An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
Toufik Mansour, Gökhan Yıldırım
We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of pattern…
Statistics on bargraphs of inversion sequences of permutations
Toufik Mansour, Mark Shattuck
We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both th…