
Theoretical Computer Science and Discrete Mathematics
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
The 57 revised full papers were carefully reviewed and selected from 210 submissions. The papers cover a broad range of topics such as line graphs and its generalizations, large graphs of given degree and diameter, graphoidal covers, adjacency spectrum, distance spectrum, b-coloring, separation dimension of graphs and hypergraphs, domination in graphs, graph labeling problems, subsequences of words and Parike matrices, lambda-design conjecture, graph algorithms and interference model for wireless sensor networks.
More details
Other editions
Additional editions

Persons
Content
- Intro
- Preface
- Organization
- Contents
- Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two
- 1 Introduction
- 2 Drn of Biregular Bipartite Graphs
- References
- 1-Normal DRA for Insertion Languages
- 1 Introduction
- 2 Preliminaries
- 2.1 Restarting Automaton with Delete Operation (DRA)
- 2.2 Insertion Grammars
- 3 1-Normal DRA
- 4 1-Normal DRA and Insertion Grammar
- 5 The Power of 1-Normal DRA
- 6 Conclusion
- References
- Formal Language Representation and Modelling Structures Underlying RNA Folding Process
- 1 Introduction
- 2 Preliminaries
- 2.1 Matrix Insertion-Deletion Systems
- 3 Modelling Bio-Molecular Structures
- 4 Conclusion
- References
- Homometric Number of a Graph and Some Related Concepts
- 1 Introduction
- 1.1 Basic Definitions and Preliminaries
- 2 Homometric Number
- 3 Regular Graphs
- 4 Some Related Graph Parameters
- References
- Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2
- 1 Introduction
- 2 Forbidden Induced Subgraphs of ATE - Free Bigraphs of Ferrers Dimension 2
- References
- Global Secure Domination in Graphs
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images
- 1 Introduction
- 2 Proposed Method
- 2.1 Image Encryption
- 2.2 Pre-processing and Location Map
- 2.3 Duplicating Pixel Values
- 2.4 Data Embedding, Extracting and Recovery
- 3 Experimental Results
- 3.1 6-Rounds Duplicating for Improving Data Capacity
- 3.2 File Size
- 3.3 Reversibility
- 4 Conclusion
- References
- Indicated Coloring of Cartesian Product of Graphs
- 1 Introduction
- 2 Indicated Coloring on Cartesian Product of Graphs
- References
- A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network
- 1 Introduction
- 2 Privacy Requirements of Big Data
- 3 Existing Mechanisms for Data Privacy and Graph Protection
- 4 Cosine Similarity with P-Stability
- 5 Performance Evaluation
- 6 Conclusion
- References
- On Nearly Distance Magic Graphs
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs
- 1 Introduction
- 2 Evenly Partite Directed Bigraph Factorization of (CmKn)*
- 3 Evenly Partite Directed Bigraph Factorization of (KmKn)*
- 4 Conclusion
- References
- Minimum Layout of Circulant Graphs into Certain Height Balanced Trees
- 1 Introduction
- 2 Main Results
- 3 Conclusion
- References
- Dissecting Power of Certain Matrix Languages
- 1 Introduction
- 2 Preliminaries
- 3 Dissecting Matrix Languages
- 4 Conclusion
- References
- Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set
- 1 Introduction
- 2 Drn of Split Graphs
- 3 Conclusion
- References
- Distance Antimagic Labelings of Graphs
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- Probabilistic Conjunctive Grammar
- 1 Introduction
- 2 Context-Free Grammar (CFG) and Probabilistic Context-Free Grammar (PCFG)
- 3 Conjunctive Grammar (CG) and Probabilistic Conjunctive Grammar (PCG)
- 3.1 Binary Normal Form of PCG
- 4 Conclusion
- References
- (1, 2)-Domination in Graphs
- 1 Introduction
- 2 Bounds of 1, 2 in terms of
- 3 Composition of Two Graphs
- 4 Some Characterizations
- 5 Trees
- References
- New Construction on SD-Prime Cordial Labeling
- 1 Introduction
- 2 Main Results
- References
- Dominator Coloring of Generalized Petersen Graphs
- 1 Introduction
- 2 Main Results
- 3 Conclusion
- References
- Super Edge-Antimagic Gracefulness of Disconnected Graphs
- 1 Introduction
- 2 Main Results
- References
- Mixed Noise Elimination and Data Hiding for Secure Data Transmission
- 1 Introduction
- 2 Module Description
- 2.1 Pre-processing
- 2.2 Filtering
- 2.3 Denoising
- 2.4 Transmitter Side
- 2.5 Receiver Side
- 3 Proposed System Process Flow Diagram
- 3.1 Results and Discussion
- 4 Conclusion
- References
- Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images
- 1 Introduction
- 2 Previous Works
- 3 Two Dimensional FIR Filter
- 4 Median Filter
- 5 Additive and Multiplicative Noise in Images
- 5.1 Additive Noise
- 5.2 Multiplicative Noise
- 6 Particle Swarm Optimization
- 7 Design Formulation
- 8 Results and Discussion
- 9 Conclusion
- References
- Irregularity Strength of Corona of Two Graphs
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- 1-Distant Irregularity Strength of Graphs
- 1 Introduction
- 2 1-Distant Irregularity Strength of Certain Families of Graphs
- 3 Conclusion and Scope
- References
- Cloud Data Security Based on Data Partitions and Multiple Encryptions
- 1 Introduction
- 2 Proposed Scheme
- 2.1 Algorithm for Encryption
- 2.2 Algorithm for Decryption
- 3 Implementation and Testing
- 4 Conclusion
- 5 Future Work
- References
- Upper Majority Domination Number of a Graph
- 1 Introduction
- 2 Upper Majority Domination
- 3 Conclusion and Scope
- References
- Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph
- 1 Introduction
- 2 Laplacian Matrix and Signless Laplacian Matrix
- 3 Determinant of Laplacian Matrix and Signless Laplacian Matrix
- 4 Conclusion
- References
- On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs
- 1 Introduction
- 2 Preliminaries
- 3 NP-completeness Results
- 4 Hardness of Approximating Min-UR-Matching
- 5 Chain Graphs
- 6 Conclusion
- References
- Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs
- 1 Introduction
- 2 Preliminaries
- 3 Partial Grundy Coloring in Perfect Elimination Bipartite Graph
- 4 Grundy Coloring in Chain Graph
- 5 Partial Grundy Coloring in Subclasses of Chordal Graphs
- 6 Conclusion
- References
- On Prime Distance Labeling of Graphs
- 1 Introduction
- 2 Main Results
- References
- Dominator Colorings of Products of Graphs
- 1 Introduction
- 2 Dominator Chromatic Number of the Tensor Product of Graphs
- 3 Dominator Chromatic Number of the Cartesian Product of Graphs
- 4 Conclusion
- References
- Efficient Hybrid Approach for Compression of Multi Modal Medical Images
- 1 Introduction
- 2 Related Works
- 3 Methodologies for Medical Image Compression
- 3.1 Fractal Algorithm
- 3.2 Radial Basis Function Neural Network (RBFNN) for Image Compression
- 3.3 Hybrid Image Compression
- 4 Performance Parameters
- 5 Results
- 5.1 Compression Ratio
- 5.2 PSNR
- 5.3 Memory
- 6 Conclusion and Future Work
- References
- The Median Problem on Symmetric Bipartite Graphs
- 1 Introduction
- 2 Median Problem on Symmetric Bipartite Graphs
- 3 Bipartite Graph of a Graph
- 4 The Median Problem on Square of Bipartite Graphs
- References
- Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions
- 1 Introduction
- 1.1 Basic Definitions
- 2 Unique Membership and Unique Non Membership Transitions
- 3 Complete Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions
- 4 Conclusion
- References
- Independent 2-Point Set Domination in Graphs
- 1 Introduction
- 2 Basic Results
- 3 Some Classes of i-2psd Graphs
- 4 Conclusion
- References
- On Graphs Whose Graphoidal Length Is Half of Its Size
- 1 Introduction
- 1.1 Terminology and Notation
- 2 Graphs with Graphoidal Length "4262304 q/2"5263305
- 3 Characterization of Graphs in F*
- 4 Conclusion
- References
- Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets
- 1 Introduction
- 2 Perfect and Efficient Psd-Sets
- 3 Conclusion and Scope
- References
- Graphoidal Length and Graphoidal Covering Number of a Graph
- 1 Introduction
- 2 Main Results
- 3 Conclusion and Scope
- References
- An Overview of the MapReduce Model
- 1 Introduction
- 2 Implementation Scrutiny
- 2.1 Categorization
- 2.2 Feature Selection
- 2.3 C5.0 Classifier
- 3 Conclusion
- References
- Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach
- 1 Introduction
- 2 Materials and Methods
- 2.1 String Database
- 2.2 Cytoscape
- 2.3 Topological Analysis
- 2.4 Functional Enrichment Analysis
- 3 Results
- 4 Discussion
- 5 Conclusion
- References
- On Total Roman Domination in Graphs
- 1 Introduction
- 2 Bounds on Total Roman Domination Number
- 3 Bounds in Terms of Girth
- References
- Restrained Differential of a Graph
- 1 Introduction
- 2 Notations
- 3 Restrained Differential Values of Some Standard Graphs
- 4 Bounds on (G)
- References
- The Distinguishing Number of Kronecker Product of Two Graphs
- 1 Introduction
- 2 Main Results
- References
- Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing
- 1 Introduction
- 2 Preliminaries
- 3 Alphabetic Flat Splicing Equal Matrix Grammar Systems
- 4 Application
- References
- 3-Simple 2-Fold 5-Cycle Systems
- 1 Introduction and Preliminaries
- 2 Main Results
- References
- ANN-Based Bias Correction Algorithm for Precipitation in the Yarra River Basin, Australia
- 1 Introduction
- 2 Study Area and Data Set
- 3 Methods
- 3.1 Linear Scaling Method
- 3.2 Local Intensity Method
- 3.3 Power Transformation
- 3.4 ANN-based Bias Correction Algorithm
- 4 Results and Discussions
- 5 Conclusions
- References
- Some Diameter Notions of the Generalized Mycielskian of a Graph
- 1 Introduction
- 2 Background
- 3 Preliminaries
- 4 Diameter of the Generalized Mycielskian
- 5 Diameter Variability
- 6 Diameter Minimality of the Generalized Mycielskian
- 7 Some Bounds for D-k(m(G))
- 8 Conclusion
- References
- On Minimization of Deterministic Automaton with Rough Output
- 1 Introduction and Preliminaries
- 2 Minimal deterministic automaton of a rough language
- 3 The Derivative Automaton of a Rough Language
- 4 Recognition of Rough Language by Monoid
- References
- Statistical Approach to Trace the Source of Attack Based on the Variability in Data Flows
- 1 Introduction
- 2 Related Works
- 3 Trace Back Using Statistical Approach
- 3.1 Variation
- 3.2 Trace Back
- 4 Simulation and Results
- 4.1 Detection Example
- 4.2 Flow Diagram
- 5 Conclusion and Scope
- References
- Independent Resolving Number of Convex Polytopes
- 1 Introduction
- 2 Main Results
- 2.1 Conclusion and Scope
- References
- Signed Cycle Domination in Planar Graphs
- 1 Introduction
- 2 Main Results
- References
- An Optimization Algorithm for Task Scheduling in Cloud Computing Based on Multi-Purpose Cuckoo Seek Algorithm
- 1 Introduction
- 2 Task Scheduling
- 3 Algorithm Description
- 3.1 Cuckoo Search Algorithm
- 3.2 Purpose Cuckoo Seek Algorithm: Proposed Work
- 4 Working Methodology
- 4.1 Choose the Virtual Machine and Compare Fitness
- 4.2 Ranking Best Solution and Find Current
- 5 Data Analysis
- 5.1 Experimental Evaluation
- 5.2 Comparison Chart
- 6 Explanation of Result
- 7 Future Work
- 8 Conclusion
- References
- P3-Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order
- 1 Introduction
- 2 Preliminary Results
- 3 P3-Factorization of Km Kn
- References
- Further Progress on the Heredity of the Game Domination Number
- 1 Introduction
- 2 Edge and Vertex Removal in No-Minus Graphs
- 2.1 Edge Removal
- 2.2 Vertex Removal
- 3 Examples of No-Minus Graphs Attaining Possible Values
- 3.1 Edge Removal
- 3.2 Vertex Removal
- References
- Modeling of Dissolved Oxygen Using Genetic Programming Approach
- 1 Introduction
- 2 Experimental Setup and Tools Used
- 2.1 Experimental Setup
- 2.2 Genetic Programming
- 3 Performance Measure
- 4 Results and Discussions
- 5 Conclusions
- References
- A Stream Cipher for Real Time Applications
- 1 Introduction
- 2 Algorithm
- 3 Application for DVD Content Protection
- 4 Conclusion
- References
- Erratum to: On Total Roman Domination in Graphs
- Erratum to: Chapter "On Total Roman Domination in Graphs" in: S. Arumugam et al. (Eds.), Theoretical Computer Science and Discrete Mathematics, LNCS 10398, https://doi.org/10.1007/978-3-319-64419-6_42
- Author Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.