Dorota Bród

Learn More
In this paper, we define a new kind of Fibonacci numbers generalized in the distance sense. This generalization is related to distance Fibonacci numbers and distance Lucas numbers, introduced quite recently. We also study distinct properties of these numbers for negative integers. Their representations and interpretations in graphs are also studied. © 2013(More)
A dominating set of a graph G = (V,E) is a subset D of V such that every vertex of V − D is adjacent to a vertex in D. In this paper we introduce a generalization of domination as follows. For graphs G and H, an H-matching M of G is a subgraph of G such that all components of M are isomorphic to H. An H-dominating matching of G is a Hmatching D of G such(More)
  • 1