An analogue of the logistic map in two dimensions

This is a sequel to our earlier work on the modulated logistic map. Here, we first show that the map comes under the universality class of Feigenbaum. We then give evidence for the fact that our model can generate strange attractors in the unit square for an uncountable number of parameter values in the range μ∞<μ<1. Numerical plots of the attractor for several values of μ are given and the self-similar structure is explicity shown in one case. The fractal and information dimensions of the attractors for many values of μ are shown to be greater than one and the variation in their structure is analysed using the two Lyapunov exponents of the system. Our results suggest that the map can be considered as an analogue of the logistic map in two dimensions and may be useful in describing certain higher dimensional chaotic phenomena.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed