Order Total (1 Item Items):
Shipping Destination:
Sudhakaraiah Anupalli (47 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (47)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (47)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (47)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (29)
- Not Print on Demand (13)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Various Studies on Split and Non- Split Dominating Sets of an Interval: Various Studies on Split And Nonsplit Dominating Sets of an Interval Graph Using an Algorithm with Odd and Even Vertices
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 58.39
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
-
Studies on Dominating Sets of I G & C a Graphs Using Algorithms
Language: English
Published by VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2014
ISBN 10: 3659473367 ISBN 13: 9783659473364
Condition: New. pp. 180.
-
Taschenbuch. Condition: Neu. Study on non-Split Restrained Domination and Average Distance | Average Distance of Interval Graphs with Algorithms An Overt Study on Domination Numbers, NonSplit Restrained Domination | Anupalli Sudhakaraiah (u. a.) | Taschenbuch | Englisch | 2021 | Scholars' Press | EAN 9786138948803 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
-
Taschenbuch. Condition: Neu. Strong,Split Strong Dominating Sets And Total Bondage number of IG&CAG | some studies on strong, split strong dominating sets and total bondage number, complementary tree domination number ofIG | Venkateswarlu Talluru | Taschenbuch | 96 S. | Englisch | 2015 | Scholars' Press | EAN 9783639769203 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
-
Taschenbuch. Condition: Neu. Conspicuous Studies on Dominating Sets and Neighbourhood Sets | Some Conspicuous Studies on Dominating Sets and Neighborhoods Sets of an Interval Graph and Circular - Arc Graph | Anupalli Sudhakaraiah (u. a.) | Taschenbuch | Englisch | 2022 | GlobeEdit | EAN 9786200635877 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
-
Studies On Dominating Sets Of I G & C A Graphs Using Algorithms | Some Studies On Dominating Sets Of Interval Graphs And Circular-arc Graphs Using Algorithms And Networks
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659473367 ISBN 13: 9783659473364
Taschenbuch. Condition: Neu. Studies On Dominating Sets Of I G & C A Graphs Using Algorithms | Some Studies On Dominating Sets Of Interval Graphs And Circular-arc Graphs Using Algorithms And Networks | Anupalli Sudhakaraiah (u. a.) | Taschenbuch | 180 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659473364 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
-
Taschenbuch. Condition: Neu. Study of All Powers of Paths and Cycles Towards Domination | Study of All Powers of Paths and Cycles Towards Domination and Labeling Numbers | Anupalli Sudhakaraiah (u. a.) | Taschenbuch | Englisch | 2022 | GlobeEdit | EAN 9786200630575 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
-
Taschenbuch. Condition: Neu. Various Studies on Split and Non- Split Dominating Sets of an Interval | Various Studies on Split And Nonsplit Dominating Sets of an Interval Graph Using an Algorithm with Odd and Even Vertices | Anupalli Sudhakaraiah (u. a.) | Taschenbuch | Englisch | 2025 | Scholars' Press | EAN 9783639712759 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.
-
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Various Studies on Split and Non- Split Dominating Sets of an Interval
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
£ 60.75
£ 3.29 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
-
Interval graphs, circular-arc And circular-arc overlaps graphs
Language: English
Published by LAP LAMBERT Academic Publishing Sep 2013, 2013
ISBN 10: 3659448729 ISBN 13: 9783659448720
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Circular-arc graphs are a new class of intersection graphs, defined for a set of arcs on a circle. A graph is a circular-arc graph, if it is the intersection graph of a finite set of arcs on a circle.That is, there exists one arc for each vertex of G and two vertices in G are adjacent in G,if and only if the corresponding arcs intersect.A vertex is said to dominate another vertex if there is an edge between the two vertices.If we bend the arc into a line, then the family of arcs is transformed into a family of intervals.Therefore, every interval graph is a CAG, where the opposite is always not true. However,these days CAG as well as interval graphs are being patronized very much. The combinatorial structures in CAG are varied and extensive, where it finds an application in many other fields such as biology, genetics, traffic control,computer science and particularly useful in cyclic scheduling and computer storage allocation problems etc.Circular-arc overlap graphs are a new class of overlap graphs introduced by Kashiwabara and Masuda [2], defined for a set of arcs on a circle. 128 pp. Englisch.
-
Conspicuous Studies on Dominating Sets and Neighbourhood Sets
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Let be the given interval family. Each interval i in I is represented by [ai, bi] for i = 1, 2, . n. here ai is called the left endpoint and bi is the right end point of the interval Ii. Without loss of generality we may assume that all end points of the intervals in I which are distinct between 1 and 2n. The intervals are labelled in the increasing order of their right end points. Two intervals i and j are said to intersect each other, if they have non-empty intersection. Interval graphs play important role in numerous applications, many of which are scheduling problems. They are a subset of perfect graphs. A graph G = (V, E) is called an interval graph if there is a one-to-one correspondence between V and I such that two vertices of G are joined by an edge in E if and only if their corresponding intervals in I intersect. 136 pp. Englisch.
-
Some Studies on Dominating Sets and Restrained Dominating Sets
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In general an undirected graph is an interval graph (IG), if the vertex set V can be put into one-to-one correspondence with a set of intervals on the real line , such that two vertices are adjacent in G if and only if their corresponding intervals have non-empty intersection. The set I is called an interval representation of G and G is referred to as the intersection graph Let be any interval family where, each is an interval on the real line and , for . Here is called the left end point labeling and is the right end point labeling of . Circular - arc graphs are introduced as generalization of Interval graphs. If we bend the real line into a circle, then any family of intervals of the real line is transformed into a family of arcs of the circle. Therefore, every interval graph is a circular - arc graph. But, the converse need not be true. However both these classes of graphs have received considerable attention in the literature in recent years and have been studied extensively. A circular - arc graph is the intersection graph of a set of arcs on the circle. 160 pp. Englisch.
-
-
Condition: New. Print on Demand.
-
Studies On Dominating Sets Of I G & C A Graphs Using Algorithms
Language: English
Published by LAP LAMBERT Academic Publishing Feb 2014, 2014
ISBN 10: 3659473367 ISBN 13: 9783659473364
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Research in graph theory and its applications have increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a research for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph corresponding Interval graph as well as circular arc graph, the main task for the Mathematician is to eliminate the often arbitrary and Cumbersome definitions,keeping only the 'deep' Mathematical problems.The subject of graph theoreticalgorithms is as old as graph theory itself,which is usually regarded as having started with Euler's famous solution of the problem of the seven bridges of Konigsberg.An algorithm is named after the 9th century Persian Mathematician Muhammad Musa Al-Khwarizmi,who was part of the royal court in Baghdad and who lived from about 780 to 850. Algorithms are used for calculation,data processing and automated reasoning.Moreprecisely, an algorithm is an effective method expressed as a finite set of well defined instructions for calculating a function.The use of the Algorithm evolved to include all definite procedures for performing tasks. 180 pp. Englisch.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sudhakaraiah Dr. AnupalliDr. A. Sudhakaraiah is M.Sc. in Mathematics in 1999, he was awarded Ph.D. in Graph theory by S.V. University in 2003. Presently, he is working as Associate Professor in Dept. of Mathematics, S.V. University.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Anupalli SudhakaraiahDr.A.Sudhakaraiah M.Sc.Mathematics in 1999,he was awarded,Ph.D.in Graph theory by S.V.U.in 2003 and he is working as Asst.Professor in Dept.of maths, S.V.U,Tirupati from till now.He produced,5 PhD,10 M.Phil,Degre.
-
Various Studies on Split and Non- Split Dominating Sets of an Interval
Language: English
Published by Scholars' Press Jan 2025, 2025
ISBN 10: 3639712757 ISBN 13: 9783639712759
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 132 pp. Englisch.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Let be the given interval family. Each interval i in I is represented by [ai, bi] for i = 1, 2, . n. here ai is called the left endpoint and bi is the right end point of the interval Ii. Without loss of generality we may assume that all end points of the .
-
Interval graphs, circular-arc And circular-arc overlaps graphs
Language: English
Published by LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659448729 ISBN 13: 9783659448720
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sudhakaraiah AnupalliDr.A SUDHAKARAIAH MSc PhD is ASSISTANT PROFESSOR IN MATHEMATICS in the Department of FUTUR STUDIES Sri Venkateswara University TIRUPATI.A distinguished PROFESSOR,has 14years teaching experience.He also published .
-
Condition: New. PRINT ON DEMAND.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sudhakaraiah AnupalliDr. A Sudhakariah is M.Sc. in Mathematics in 1999, he was awarded Ph.D. in Graph theory by S.V. University in 2003. Presently,he is working as Assistant Professor in Dept. of Mathematics, S.V. University Tirupa.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sudhakaraiah Dr.AnupalliDr. A. Sudhakaraiah obtained PhD in Mathematics from Sri Venkateswara University, Tirupati and carrying out research in all areas relating to Graph theory Algebra etc. He has guided 16 Ph.D scholars and 12 M P.
-
Studies On Dominating Sets Of I G & C A Graphs Using Algorithms
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659473367 ISBN 13: 9783659473364
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sudhakaraiah AnupalliDr.A. SUDHAKARAIAH MSC,PHD is an Assistant professor department of mathematics S.V.UNIVERSITY TIRUPATI,AP INDIA.He is having 15 years teaching experience,35published ,36 presented papers national and internation.
