1 citations · 1 across the 10 of their papers we have counts for
6 papers · 1 filter
Staircase graph words
Sela Fried, Toufik Mansour
Generalizing the notion of staircase words, introduced by Knopfmacher et.\ al, we define staircase graph words. These are functions from the vertex set of a graph into the…
The total number of descents and levels in tensor words and cyclic tensor words
Sela Fried, Toufik Mansour
We obtain an explicit formula for the total number of descents and levels in tensor words and cyclic tensor words of arbitrary dimension. We also establish the exact maximal number…
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…