Let G be a connected graph with vertex set V(G) and d(u,v) the distance between vertices u v. A of S={s1,s2,…,sk}?V(G) is called resolving for if, any two distinct u,v?V(G), there si?S such that d(u,si)?d(v,si). S fault-tolerant if S\{x} also set, each x in S, metric dimension G, denoted by ??(G), minimum cardinality set. The paper Basak et al. on circulant graphs Cn(1,2,3) has determined exact...

The graph is a pair of sets , where finite set whose elements are called vertices, and the pairs members . which edge. Let be simple distance between points denoted by length shortest path Given there vertex on connected then If -partition representation with respect to -ordered pairs, for all different, partition dimension partition. minimal -number -differentiating In this study, dimensions s...

In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f an assignment such that 0 has at least one neighbor 2 and all vertices labeled by are independent, then called outer independent Roman dominating function (OIRDF). The domination strengthened if 1, 3, each two neighbors double (OIDRDF). weight of (OIDRDF) OIRDF the sum f(v) for v?V. (double) number (?oidR(G)) ?oiR(G) minimum taken ...

We prove that a germ of a holomorphic map f between Cn and Cn ′ sending one real-algebraic submanifold M ⊂ Cn into another M ′ ⊂ Cn ′ is algebraic provided M ′ contains no complex-analytic discs and M is generic and minimal. We also propose an algorithm for finding complex-analytic discs in a real submanifold.

Let Cn be the cyclic group of n elements, and let S = (a1, · · · , ak) be a sequence of elements in Cn. We say that S is a zero sequence if ∑k i=1 ai = 0 and that S is a minimal zero-sequence if S is a zero sequence and S contains no proper zero subsequence. In this paper we prove, among other results, that if S is a minimal zero sequence of elements in Cn and |S| ≥ n − [ 3 ] + 1, then there ex...

For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i− j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedba...

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740 minimal feedback vertex sets and that there is an infinite family of tournamen...

A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we determine the domination and the total domination number in the Circulant graphs Cn〈1, 3〉, and then study γ-criticality...

In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number Fn+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pe...