Pushpalatha P (14 results)

Condition: New.

Condition: New.

Condition: New.

Condition: New. pp. 380.

Condition: New. pp. 380.

Taschenbuch. Condition: Neu. Study of excellence in graphs with respect to various parameters | A . P. Pushpalatha Ponnupandian (u. a.) | Taschenbuch | 76 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786139879403 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.…

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condition: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In 1980, Claude Berge introduced B- graphs. These are graphs in which every vertex is contained in a maximum independent set. This idea led to the concept of excellence in graphs which has been introduced by Fricke et al with respect to several parameters like domination, independence, etc. Let be a parameter and let G (V, E) be simple graph. A vertex v in V (G) is said to be -good if v belongs to a -minimum ( -maximum) set of G according as is a super hereditary (hereditary) parameter. v is said to be -bad if it is not -good. A graph G is said to be -excellent if every vertex of G is -good. G is - commandable if number of -good vertices in G is strictly greater than the number -bad vertices of G and there should be at least one -bad vertex in G. G is said to be -fair if number of - good vertices in G is equal to the number of - bad vertices in G and G is said to be -poor if number of -bad vertices in G is strictly greater than the number of - good vertices in G. This book is devoted to the study of graphs with respect to the Independence and vertex covering parameters. 76 pp. Englisch.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ponnupandian A .P. PushpalathaDr. A. P. Pushpalatha, an Indian is currently working at Thiagarajar College of Engineering, Madurai. She is a 24 year experienced Mathematician with extensive knowledge in Graph Theory. Some of her note.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Gurusamy G.JothilakshmiDr.Jothilaksmi Gurusamy, an Indian is currently working at Thiagarajar College of Engineering, Madurai. She is a 25 year experienced mathematician with extensive knowledge in Graph Theory. Some of here notewor.…

Taschenbuch. Condition: Neu. When Life Speaks Through Synchronicity | A Journey of Awareness, Gratitude, and Meaningful Coincidences | Pushpalatha. P. K. | Taschenbuch | Englisch | 2026 | Notion Press | EAN 9798906734983 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In 1980, Claude Berge introduced B- graphs. These are graphs in which every vertex is contained in a maximum independent set. This idea led to the concept of excellence in graphs which has been introduced by Fricke et al with respect to several parameters like domination, independence, etc. Let be a parameter and let G (V, E) be simple graph. A vertex v in V (G) is said to be -good if v belongs to a -minimum ( -maximum) set of G according as is a super hereditary (hereditary) parameter. v is said to be -bad if it is not -good. A graph G is said to be -excellent if every vertex of G is -good. G is - commandable if number of -good vertices in G is strictly greater than the number -bad vertices of G and there should be at least one -bad vertex in G. G is said to be -fair if number of - good vertices in G is equal to the number of - bad vertices in G and G is said to be -poor if number of -bad vertices in G is strictly greater than the number of - good vertices in G. This book is devoted to the study of graphs with respect to the Independence and vertex covering parameters.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch.…

Buch. Condition: Neu. When Life Speaks Through Synchronicity | A Journey of Awareness, Gratitude, and Meaningful Coincidences | Pushpalatha. P. K. | Buch | Englisch | 2026 | Notion Press | EAN 9798906734990 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …