The average cut-rank of graphs

@article{Nguyen2020TheAC,
  title={The average cut-rank of graphs},
  author={Huy-Tung Nguyen and Sang-il Oum},
  journal={Eur. J. Comb.},
  year={2020},
  volume={90},
  pages={103183}
}
Abstract The cut-rank of a set X of vertices in a graph G is defined as the rank of the X × ( V ( G ) ∖ X ) matrix over the binary field whose ( i , j ) -entry is 1 if the vertex i in X is adjacent to the vertex j in V ( G ) ∖ X and 0 otherwise. We introduce the graph parameter called the average cut-rank of a graph, defined as the expected value of the cut-rank of a random set of vertices. We show that this parameter does not increase when taking vertex-minors of graphs and a class of graphs… Expand
1 Citations
Scattered Classes of Graphs

References

SHOWING 1-10 OF 31 REFERENCES
Rank-width and vertex-minors
  • Sang-il Oum
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 2005
Induced minors and well-quasi-ordering
On minimal rank over finite fields
Approximating clique-width and branch-width
Branch-depth: Generalizing tree-depth of graphs
Induced minors and well-quasi-ordering
Induced subgraphs and well-quasi-ordering
  • P. Damaschke
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1990
Boundary Properties of Well-Quasi-Ordered Sets of Graphs
Rank-Width and Well-Quasi-Ordering
  • Sang-il Oum
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2008
...
1
2
3
4
...