Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as "Divided Cube Difference Cordial Labeling" and investigates the family of staircase graphs, Aztec diamond graphs for possible results. Paths, stars, bistars, corona graphs, trees, complement of complete bipartite graphs are proved to satisfy this new labeling method. Arbitrary subdivisions of a tree Tn are examined and shown to be divided cube difference cordial. This research work throughs open the opportunity for further investigation of possible other graphs which are still not explored with respect to this new labeling technique..
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Dr. M. Antony Arockiasamy has eighteen years of teaching experience and fourteen years of research experience in Graph Theory. His area of interest includes graph labeling, coding theory, cryptography, probability theory, DNA Computing etc. At present, he is working as faculty of Mathematics at Sacred Heart College, Tirupattur, Tamilnadu, India.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as 'Divided Cube Difference Cordial Labeling' and investigates the family of staircase graphs, Aztec diamond graphs for possible results. Paths, stars, bistars, corona graphs, trees, complement of complete bipartite graphs are proved to satisfy this new labeling method. Arbitrary subdivisions of a tree Tn are examined and shown to be divided cube difference cordial. This research work throughs open the opportunity for further investigation of possible other graphs which are still not explored with respect to this new labeling technique. 76 pp. Englisch. Bestandsnummer des Verkäufers 9786205489239
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as Divided Cube Difference Cordial Labeling and investigates the family of stairca. Bestandsnummer des Verkäufers 699354128
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as 'Divided Cube Difference Cordial Labeling' and investigates the family of staircase graphs, Aztec diamond graphs for possible results. Paths, stars, bistars, corona graphs, trees, complement of complete bipartite graphs are proved to satisfy this new labeling method. Arbitrary subdivisions of a tree Tn are examined and shown to be divided cube difference cordial. This research work throughs open the opportunity for further investigation of possible other graphs which are still not explored with respect to this new labeling technique.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. Bestandsnummer des Verkäufers 9786205489239
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as 'Divided Cube Difference Cordial Labeling' and investigates the family of staircase graphs, Aztec diamond graphs for possible results. Paths, stars, bistars, corona graphs, trees, complement of complete bipartite graphs are proved to satisfy this new labeling method. Arbitrary subdivisions of a tree Tn are examined and shown to be divided cube difference cordial. This research work throughs open the opportunity for further investigation of possible other graphs which are still not explored with respect to this new labeling technique. Bestandsnummer des Verkäufers 9786205489239
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Divided Cube Difference Cordial Labeling of Graphs | Divided Cube Difference Cordial Labeling of Staircase Graphs and Aztec Diamond Graphs | M. Antony Arockiasamy (u. a.) | Taschenbuch | Englisch | 2022 | LAP LAMBERT Academic Publishing | EAN 9786205489239 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 123946342
Anzahl: 5 verfügbar