Hosoya Polynomials and Wiener Indices of Distances in Graphs: Wiener Indices & Hosoya Polynomials of graphs - Couverture souple

M. Ali, Ahmed ; A. Ali, Ali ; H. Ismail, Tahir

9783845401010: Hosoya Polynomials and Wiener Indices of Distances in Graphs: Wiener Indices & Hosoya Polynomials of graphs

Couverture souple

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Editeur : LAP LAMBERT Academic Publishing, 2011

Afficher les exemplaires de cette �dition comportant l'ISBN

0 D'occasion

8 Neuf

De EUR 59

Book by M Ali Ahmed A Ali Ali H Ismail Tahir

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

Pr�sentation de l'�diteur

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.

Biographie de l'auteur

Ahmed 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 Mathematics

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: LAP LAMBERT Academic Publishing
Date d'�dition: 2011
Langue: anglais
ISBN 10: 384540101X
ISBN 13: 9783845401010
Reliure: Broch�
Nombre de pages: 148
Coordonn�es du fabricant: non disponible
Personne responsable: KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne

R�sultats de recherche pour Hosoya Polynomials and Wiener Indices of Distances...

Image fournie par le vendeur

Hosoya Polynomials and Wiener Indices of Distances in Graphs

Ahmed M. Ali

Edit� par LAP LAMBERT Academic Publishing Jul 2011, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783845401010

Contacter le vendeur

Acheter neuf

EUR 59

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Hosoya Polynomials and Wiener Indices of Distances in Graphs

Tahir H. Ismail Ali A. Ali Ahmed M. Ali

Edit� par VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Couverture souple

Vendeur : Books Puddle, New York, NY, Etats-Unis

�valuation du vendeur 4 sur 5 �toiles

Etat : New. pp. 148. N� de r�f. du vendeur 26128893253

Contacter le vendeur

Acheter neuf

EUR 91,96

Exp�dition �EUR 3,43
Exp�dition nationale�: Etats-Unis

Quantit� disponible : 4 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Hosoya Polynomials and Wiener Indices of Distances in Graphs

Ahmed M. Ali|Ali A. Ali|Tahir H. Ismail

Edit� par LAP LAMBERT Academic Publishing, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : 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. N� de r�f. du vendeur 5480281

Contacter le vendeur

Acheter neuf

EUR 48,50

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Hosoya Polynomials and Wiener Indices of Distances in Graphs

H. Ismail Tahir A. Ali Ali M. Ali Ahmed

Edit� par VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Couverture souple

impression � la demande

Vendeur : Majestic Books, Hounslow, Royaume-Uni

�valuation du vendeur 4 sur 5 �toiles

Etat : 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. N� de r�f. du vendeur 131694234

Contacter le vendeur

Acheter neuf

EUR 92,98

Exp�dition �EUR 7,58
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Hosoya Polynomials and Wiener Indices of Distances in Graphs

H. Ismail Tahir A. Ali Ali M. Ali Ahmed

Edit� par VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Couverture souple

impression � la demande

Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne

�valuation du vendeur 4 sur 5 �toiles

Etat : New. PRINT ON DEMAND pp. 148. N� de r�f. du vendeur 18128893263

Contacter le vendeur

Acheter neuf

EUR 95,92

Exp�dition �EUR 9,95
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 4 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Hosoya Polynomials and Wiener Indices of Distances in Graphs

Ahmed M. Ali

Edit� par LAP LAMBERT Academic Publishing Jul 2011, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783845401010

Contacter le vendeur

Acheter neuf

EUR 59

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Hosoya Polynomials and Wiener Indices of Distances in Graphs : Wiener Indices & Hosoya Polynomials of graphs

Ahmed M. Ali

Edit� par LAP LAMBERT Academic Publishing, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783845401010

Contacter le vendeur

Acheter neuf

EUR 59

Exp�dition �EUR 61,19
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Hosoya Polynomials and Wiener Indices of Distances in Graphs | Wiener Indices & Hosoya Polynomials of graphs

Ahmed M. Ali (u. a.)

Edit� par LAP LAMBERT Academic Publishing, 2011

ISBN 10 : 384540101X ISBN 13 : 9783845401010

Neuf Taschenbuch

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Contacter le vendeur

Acheter neuf

EUR 51,10

Exp�dition �EUR 70
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Articles li�s � Hosoya Polynomials and Wiener Indices of Distances...

Hosoya Polynomials and Wiener Indices of Distances in Graphs: Wiener Indices & Hosoya Polynomials of graphs - Couverture souple

Synopsis

Pr�sentation de l'�diteur

Biographie de l'auteur

R�sultats de recherche pour Hosoya Polynomials and Wiener Indices of Distances...

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf