10,745 research outputs found
Strong geodetic problem on Cartesian products of graphs
The strong geodetic problem is a recent variation of the geodetic problem.
For a graph , its strong geodetic number is the cardinality of
a smallest vertex subset , such that each vertex of lies on a fixed
shortest path between a pair of vertices from . In this paper, the strong
geodetic problem is studied on the Cartesian product of graphs. A general upper
bound for is determined, as well as exact values
for , , and certain prisms.
Connections between the strong geodetic number of a graph and its subgraphs are
also discussed.Comment: 18 pages, 9 figure
Parameterized Complexity of Geodetic Set
A vertex set S of a graph G is geodetic if every vertex of G lies on a shortest path between two vertices in S. Given a graph G and k ? ?, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size at most k. Complementing various works on Geodetic Set restricted to special graph classes, we initiate a parameterized complexity study of Geodetic Set and show, on the negative side, that Geodetic Set is W[1]-hard when parameterized by feedback vertex number, path-width, and solution size, combined. On the positive side, we develop fixed-parameter algorithms with respect to the feedback edge number, the tree-depth, and the modular-width of the input graph
The forcing hull and forcing geodetic numbers of graphs
AbstractFor every pair of vertices u,v in a graph, a uâv geodesic is a shortest path from u to v. For a graph G, let IG[u,v] denote the set of all vertices lying on a uâv geodesic. Let SâV(G) and IG[S] denote the union of all IG[u,v] for all u,vâS. A subset SâV(G) is a convex set of G if IG[S]=S. A convex hull [S]G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if IG[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset FâV(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number fh(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number fg(G) of G. In the paper, we construct some 2-connected graph G with (fh(G),fg(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+bâ„2, there exists a 2-connected graph G with (fh(G),fg(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81â94]
Geodetic domination integrity in graphs
Reciprocal version of product degree distance of cactus graphs Let G be a simple graph. A subset S â V (G) is a said to be a geodetic set if every vertex u /â S lies on a shortest path between two vertices from S. The minimum cardinality of such a set S is the geodetic number g(G) of G. A subset D â V (G) is a dominating set of G if every vertex u /â D has at least one neighbor in D. The domination number Îł(G) is the minimum cardinality of a dominating set of G. A subset is said to be a geodetic dominating set of G if it is both a geodetic and a dominating set. The geodetic domination number Îłg(G) is the minimum cardinality among all geodetic dominating sets in G. The geodetic domination integrity of a graph G is defined by DIg(G) = min{|S| + m(G â S) : S is a geodetic dominating set of G}, where m(G â S) denotes the order of the largest component in GâS. In this paper, we study the concepts of geodetic dominating integrity of some families of graphs and derive some bounds for the geodetic domination integrity. Also we obtain geodetic domination integrity of some cartesian product of graphs.Publisher's Versio
On the Steiner, geodetic and hull numbers of graphs
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum
order that contains all of W. Let S(W) denote the set of all vertices in G that lie on
some Steiner W-tree; we call S(W) the Steiner interval of W. If S(W) = V (G), then
we call W a Steiner set of G. The minimum order of a Steiner set of G is called the
Steiner number of G.
Given two vertices u, v in G, a shortest u â v path in G is called a u â v geodesic.
Let I[u, v] denote the set of all vertices in G lying on some u â v geodesic, and let
J[u, v] denote the set of all vertices in G lying on some induced u â v path. Given a
set S ? V (G), let I[S] = ?u,v?S I[u, v], and let J[S] = ?u,v?S J[u, v]. We call I[S]
the geodetic closure of S and J[S] the monophonic closure of S. If I[S] = V (G), then
S is called a geodetic set of G. If J[S] = V (G), then S is called a monophonic set of
G. The minimum order of a geodetic set in G is named the geodetic number of G.
In this paper, we explore the relationships both between Steiner sets and geodetic
sets and between Steiner sets and monophonic sets. We thoroughly study the relationship
between the Steiner number and the geodetic number, and address the questions:
in a graph G when must every Steiner set also be geodetic and when must every Steiner
set also be monophonic. In particular, among others we show that every Steiner set
in a connected graph G must also be monophonic, and that every Steiner set in a
connected interval graph H must be geodetic
Algorithms to Find Linear Geodetic Numbers and Linear Edge Geodetic Numbers in Graphs
Given two vertices u and v of a connected graph G=(V, E), the closed interval I[u, v] is that set of all vertices lying in some u-v geodesic in G. A subset of V(G) S={v1,v2,v3,âŠ.,vk} is a linear geodetic set or sequential geodetic set if each vertex x of G lies on a vi â vi+1 geodesic where 1 ? i < k . A linear geodetic set of minimum cardinality in G is called as linear geodetic number lgn(G) or sequential geodetic number sgn(G). Similarly, an ordered set S={v1,v2,v3,âŠ.,vk} is a linear edge geodetic set if for each edge e = xy in G, there exists an index i, 1 ? i < k such that e lies on a vi â vi+1 geodesic in G. The cardinality of the minimum linear edge geodetic set is the linear edge geodetic number of G denoted by legn(G). The purpose of this paper is to introduce algorithms using dynamic programming concept to find minimum linear geodetic set and thereby linear geodetic number and linear edge geodetic set and number in connected graphs
Geodetic Graphs and Convexity.
A graph is geodetic if each two vertices are joined by a unique shortest path. The problem of characterizing such graphs was posed by Ore in 1962; although the geodetic graphs of diameter two have been described and classified by Stemple and Kantor, little is known of the structure of geodetic graphs in general. In this work, geodetic graphs are studied in the context of convexity in graphs: for a suitable family (PI) of paths in a graph G, an induced subgraph H of G is defined to be (PI)-convex if the vertex-set of H includes all vertices of G lying on paths in (PI) joining two vertices of H. Then G is (PI)-geodetic if each (PI)-convex hull of two vertices is a path. For the family (GAMMA) of geodesics (shortest paths) in G, the (GAMMA)-geodetic graphs are exactly the geodetic graphs of the original definition. For various families (PI), the (PI)-geodetic graphs are characterized. The central results concern the family (UPSILON) of chordless paths of length no greater than the diameter; the (UPSILON)-geodetic graphs are called ultrageodetic. For graphs of diameter one or two, the ultrageodetic graphs are exactly the geodetic graphs. A geometry (P,L,F) consists of an arbitrary set P, an arbitrary set L, and a set F (L-HOOK EQ) P x L. The point-flag graph of a geometry is defined here to be the graph with vertex-set P (UNION) F whose edges are the pairs {p,(p,1)} and {(p,1),(q,1)} with p,q (ELEM) P, 1 (ELEM) L, and (p,1),(q,1) (ELEM) F. With the aid of the Feit-Higman theorem on the nonexistence of generalized polygons and the collected results of Fuglister, Damerell-Georgiacodis, and Damerell on the nonexistence of Moore geometries, it is shown that two-connected ultrageodetic graphs of diameter greater than two are precisely the graphs obtained via the subdivision, with a constant number of new vertices, either of all of the edges incident with a single vertex in a complete graph, or of all edges of the form {p,(p,1)} in the point-flag graph of a finite projective plane
- âŠ