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

      Аннотация: Graphs are very convenient tools for representing the relationships among objects, which are represented by vertices. In their turn, relationships among vertices are represented by connections. In general, any mathematical object involving points and connections among them can be called a graph. Graphs are really important and probably, they are more important than we think. Graphs are among the most ubiquitous models of both natural and human made structures and Graph theory is one of the most developing branches of Mathematics with wide applications to computer science. Graph theory is applied in diverse areas such as social sciences, linguistics, physical sciences, communication engineering, networks and others. Graph theory also place an important role in several areas of computer science, such as switching theory and logic design, artificial intelligence, formal languages, computer graphics, operating system, compiler writing and information organization and retrieval. Graph theory, especially trees and binary trees are used widely in the representation of data structures.

Ключевые слова: Interval Graphs, Domination, Non-Split Domination, Restrained, Average Distance