21 research outputs found
The Mostar index of Fibonacci and Lucas cubes
The Mostar index of a graph was defined by Do\v{s}li\'{c}, Martinjak,
\v{S}krekovski, Tipuri\'{c} Spu\v{z}evi\'{c} and Zubac in the context of the
study of the properties of chemical graphs. It measures how far a given graph
is from being distance-balanced. In this paper, we determine the Mostar index
of two well-known families of graphs: Fibonacci cubes and Lucas cubes
An Interpretation of Sums of Walsh Spectrum Powers of Boolean Functions
Abstract. Boolean Functions are fundamental tools in the design of several cryptographic algorithms. They are used for S-box designing in block ciphers and utilized as filters in stream ciphers. One of the important criteria that a Boolean function should satisfy is high nonlinearity, which can be calculated using walsh transform. Some properties of the Walsh spectrum of Boolean functions are known and in this paper we introduce some other properties obtained from the sums of Walsh spectrum powers of Boolean functions
Results on the domination number and the total domination number of Lucas cubes
Lucas cubes are special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we present the exact values of total domination number of small dimensional Lucas cubes and present optimization problems obtained from the degree information of Lucas cubes, whose solutions give better lower bounds on the domination numbers and total domination numbers of Lucas cubes
On the chromatic polynomial and the domination number of k-Fibonacci cubes
Fibonacci cubes are defined as subgraphs of hypercubes, where the vertices are those without two consecutive 1's in their binary string representation. k -Fibonacci cubes are in turn special subgraphs of Fibonacci cubes obtained by eliminating certain edges. This elimination is carried out at the step analogous to where the fundamental recursion is used to construct Fibonacci cubes themselves from the two previous cubes by link edges. In this work, we calculate the vertex chromatic polynomial of k -Fibonacci cubes for k = 1, 2. We also determine the domination number and the total domination number of k -Fibonacci cubes for n, k ? 12 by using an integer programming formulation
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider k-Fibonacci cubes, which we obtain as subgraphs of Fibonacci cubes by eliminating certain edges during the fundamental recursion phase of their construction. These graphs have the same number of vertices as Fibonacci cubes, but their edge sets are determined by a parameter k. We obtain properties of k-Fibonacci cubes including the number of edges, the average degree of a vertex, the degree sequence and the number of hypercubes they contain
Rational points of the curve over
Let q be a power of an odd prime. For arbitrary positive integers h, n, m with n dividing m and arbitrary with ? ? 0 we determine the number of -rational points of the curve in many cases
The Irregularity Polynomials of Fibonacci and Lucas cubes
Irregularity of a graph is an invariant measuring how much the graph differs from a regular graph. Albertson index is one measure of irregularity, defined as the sum of | deg(u) - deg(v) | over all edges uv of the graph. Motivated by a recent result on the irregularity of Fibonacci cubes, we consider irregularity polynomials and determine them for Fibonacci and Lucas cubes. These are graph families that have been studied as alternatives for the classical hypercube topology for interconnection networks. The irregularity polynomials specialize to the Albertson index and also provide additional information about the higher moments of | deg(u) - deg(v) | in these families of graphs
L-Polynomials of the Curve
Let chi be a smooth, geometrically irreducible and projective curve over a finite field F-q of odd characteristic. The L-polynomial L-chi(t) of chi determines the number of rational points of chi not only over F-q but also over F-qs for any integer s >= 1. In this paper we determine L-polynomials of a class of such curves over F-q