Weighted Padovan graphs

Weighted Padovan graphs Φ k n , n ≥ 1 , ⌊ n 2 ⌋ ≤ k ≤ ⌊ 2 n − 2 3 ⌋ , are introduced as the graphs whose vertices are all Padovan words of length n with k 1s, two vertices being adjacent if one can be obtained from the other by replacing exactly one 01 with a 10. By definition, ∑ k | V ( Φ k n ) | = P n + 2 , where P n is the n th Padovan number. Two families of graphs isomorphic to weighted Padovan graphs are presented. The order, the size, the degree, the diameter, the cube polynomial, and the automorphism group of weighted Padovan graphs are determined. It is also proved that they are median graphs.