"

Cookies ussage consent

I agree.

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

Bipartite edge frustration of cactus chains

S. HAYAT1,* , A. KHAN2, F. YOUSAFZAI2, M. IMRAN1

Affiliation

  1. Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan
  2. School of Mathematical Sciences, University of Science and Technology of China (USTC), Hefei, Anhui, China

Abstract

A molecular graph is a graphical representation of a chemical structure which is constructed by using certain graph operation. Topological indices are global graph-theoretic parameters which are studied for molecular graphs and provide significant information related to physico-chemical properties of underlying chemical substances. Bipartite edge frustration is defined as the minimum number of edges whose deletion from the graph gives the bipartite spanning subgraph of given graph. Bipartite edge frustration is a topological index which is related to the chemical stability of various nanostructures such as Fullerenes. In this paper, the bipartite edge frustration of cactus chains are studied. We give an important conjecture generalizing this concept for whole family of cacti graphs at the end of the article..

Keywords

Bipartite edge frustration, Cactus chains.

Citation

S. HAYAT, A. KHAN, F. YOUSAFZAI, M. IMRAN, Bipartite edge frustration of cactus chains, Optoelectronics and Advanced Materials - Rapid Communications, 9, 5-6, May-June 2015, pp.869-872 (2015).

Submitted at: May 4, 2015

Accepted at: May 7, 2015