9783845401010 - hosoya polynomials and wiener indices of distances in graphs: wiener indices & hosoya polynomials of graphs von m. ali, ahmed; a. ali, ali; h. ismail, tahir (8 Ergebnisse)

Zustand: New. pp. 148.

Taschenbuch. Zustand: Neu. Hosoya Polynomials and Wiener Indices of Distances in Graphs | Wiener Indices & Hosoya Polynomials of graphs | Ahmed M. Ali (u. a.) | Taschenbuch | 148 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783845401010 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. …

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this work, we deal with three types of distances, namely ordinary distance, the minimum distance (n-distance), and the width distance (w-distance). The ordinary distance between two distinct vertices u and v in a connected graph G is defined as the minimum of the lengths of all u-v paths in G, and usually denoted by dG(u,v), or d(u,v).The minimum distance in a connected graph G between a singleton vertex v belong to V and (n-1)-subset S of V , n 2, denoted by dn(u,v) and termed n-distance, is the minimum of the distances from v to the vertices in S.The container between two distinct vertices u and v in a connected graph G is defined as a set of vertex-disjoint u-v paths, and is denoted by C(u,v). The container width w = w(C(u,v)) , is the number of paths in the container, i.e.,w(C(u,v)) = C(u.v) . The length of a container l = l(C(u,v)) is the length of a longest path in C(u,v).For every fixed positive integer w, the width distance (w-distance) between u and v is defined as: dn (u,v G)= min l(C(u,v)) ,where the minimum is taken over all containers C(u,v) of width w. Assume that the vertices u and v are distinct when w 2. 148 pp. Englisch.…

Zustand: New. Print on Demand pp. 148 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: M. Ali AhmedAhmed M. Ali, Applied Mathematics/ Graph Theory.B.Sc.(2002),M.Sc.(2005),Ph.D.(2010)Mosul University. Lecturer at University of Mosul/ College of Computer Science and MathematicsIn this work, we deal with three types o.…

Zustand: New. PRINT ON DEMAND pp. 148.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this work, we deal with three types of distances, namely ordinary distance, the minimum distance (n-distance), and the width distance (w-distance). The ordinary distance between two distinct vertices u and v in a connected graph G is defined as the minimum of the lengths of all u-v paths in G, and usually denoted by dG(u,v), or d(u,v).The minimum distance in a connected graph G between a singleton vertex v belong to V and (n-1)-subset S of V , n ¿ 2, denoted by dn(u,v) and termed n-distance, is the minimum of the distances from v to the vertices in S.The container between two distinct vertices u and v in a connected graph G is defined as a set of vertex-disjoint u-v paths, and is denoted by C(u,v). The container width w = w(C(u,v)) , is the number of paths in the container, i.e.,w(C(u,v)) = |C(u.v)|. The length of a container l = l(C(u,v)) is the length of a longest path in C(u,v).For every fixed positive integer w, the width distance (w-distance) between u and v is defined as: dn\* (u,v|G)= min l(C(u,v)) ,where the minimum is taken over all containers C(u,v) of width w. Assume that the vertices u and v are distinct when w ¿ 2.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 148 pp. Englisch.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this work, we deal with three types of distances, namely ordinary distance, the minimum distance (n-distance), and the width distance (w-distance). The ordinary distance between two distinct vertices u and v in a connected graph G is defined as the minimum of the lengths of all u-v paths in G, and usually denoted by dG(u,v), or d(u,v).The minimum distance in a connected graph G between a singleton vertex v belong to V and (n-1)-subset S of V , n 2, denoted by dn(u,v) and termed n-distance, is the minimum of the distances from v to the vertices in S.The container between two distinct vertices u and v in a connected graph G is defined as a set of vertex-disjoint u-v paths, and is denoted by C(u,v). The container width w = w(C(u,v)) , is the number of paths in the container, i.e.,w(C(u,v)) = C(u.v) . The length of a container l = l(C(u,v)) is the length of a longest path in C(u,v).For every fixed positive integer w, the width distance (w-distance) between u and v is defined as: dn (u,v G)= min l(C(u,v)) ,where the minimum is taken over all containers C(u,v) of width w. Assume that the vertices u and v are distinct when w 2.…