Independence and Completeness: Substructure Representation Using Polynomials | Chapter 5 | Research Updates in Mathematics and Computer Science Vol. 8

 

Substructures are important components of a network structure that contribute to the functionality of the entire network. In this paper, we count all possible substructures of a graph with exactly two independent partitions having complete connectivity. We represent this in a form of a polynomial in one variable.

 

Author(s) Details

Shiena Mae B. Lumpayao

Central Mindanao University, Musuan, Bukidnon, Philippines.

Regimar A. Rasid

Tawi-Tawi College of Technology and Oceanography, Mindanao State University, Tawi-Tawi, Philippines.

Rosalio G. Artes Jr.

Tawi-Tawi College of Technology and Oceanography, Mindanao State University, Tawi-Tawi, Philippines.

 

 

Please see the book here:- https://doi.org/10.9734/bpi/rumcs/v8/8034E