Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle
Copyright policy )Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle
Edge-counting vectors of subgraphs of Cartensian products are introduced as the counting vectors of the edges that project onto the factors. For several standard constructions their edge-counting vectors are computed. It is proved that the edge-counting vectors of Fibonacci cubes are the rows of the Fibonacci triangle, and the edge-counting vectors of Lucas cubes are \(F_{n-1}\)-constant vectors.
edge counting vector, Cartesian product of graphs, Fibonacci triangle, Fibonacci cubes, Lucas cubes, Fibonacci and Lucas numbers and polynomials and generalizations, Structural characterization of families of graphs, Enumeration in graph theory, partial cubes
edge counting vector, Cartesian product of graphs, Fibonacci triangle, Fibonacci cubes, Lucas cubes, Fibonacci and Lucas numbers and polynomials and generalizations, Structural characterization of families of graphs, Enumeration in graph theory, partial cubes
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!