Let
be an -by- matrix. For any real number ,
we define the polynomial
as the
-permanent of , where
is the number of
inversions of the permutation in the symmetric group .
In this note, motivated by this notion, we discuss a new graph
labeling for trees whose matrices satisfy certain -permanental
identities. We relate the number of labelings of a path with a
known integer sequence. Several examples are provided.