๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The bipartite edge frustration of graphs under subdivided edges and their related sums

โœ Scribed by Zahra Yarahmadi; Ali Reza Ashrafi

Book ID
108078753
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
343 KB
Volume
62
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The bipartite edge frustration of extens
The bipartite edge frustration of extension of splice and link graphs
โœ Zahra Yarahmadi ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by ฯ•(G). In this paper we extend the splice and link for two graphs and determine their bipartite edge frustration. As an application,

An edge grafting theorem on the energy o
An edge grafting theorem on the energy of unicyclic and bipartite graphs
โœ Hai-Ying Shan; Jia-Yu Shao; Fei Gong; Yue Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The edge grafting operation on a graph is certain kind of edge moving between two pendant paths starting from the same vertex. In this paper we show how the graph energy changes under the edge graftin