izvor podataka: crosbi
✓
The bipartite edge frustration of composite graphs (CROSBI ID 175880)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Yarahmadi, Zahra ; Došlić, Tomislav ; Ashrafi, Ali Reza
The bipartite edge frustration of composite graphs // Discrete applied mathematics, 158 (2010), 14; 1551-1558. doi: 10.1016/j.dam.2010.04.010
Podaci o odgovornosti
Yarahmadi, Zahra ; Došlić, Tomislav ; Ashrafi, Ali Reza
engleski
The bipartite edge frustration of composite graphs
The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of $G$ and denoted by $\varphi(G)$. In this paper we determine the bipartite edge frustration of some classes of composite graphs.
bipartite graph; bipartite edge frustration; composite graph
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
158 (14)
2010.
1551-1558
objavljeno
0166-218X
10.1016/j.dam.2010.04.010
Povezanost rada
Povezane osobe
Povezane ustanove
Povezani projekti
