BROWSE

Related Scientist

Oum, Sang-il's photo.

Oum, Sang-il
이산수학 그룹
more info

ITEM VIEW & DOWNLOAD

The average cut-rank of graphs

Cited 0 time in webofscience Cited 0 time in scopus
9 Viewed 0 Downloaded
Title
The average cut-rank of graphs
Author(s)
Huy-Tung Nguyen; Sang-il Oum
Subject
CLIQUE-WIDTH
Publication Date
2020-12
Journal
EUROPEAN JOURNAL OF COMBINATORICS, v.90, pp.103183
Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Abstract
© 2020 The Author(s). 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 has bounded average cut-rank if and only if it has bounded neighborhood diversity. This allows us to deduce that for each real α, the list of induced-subgraph-minimal graphs having average cut-rank larger than (or at least) α is finite. We further refine this by providing an upper bound on the size of obstruction and a lower bound on the number of obstructions for average cut-rank at most (or smaller than) α for each real α≥0. Finally, we describe explicitly all graphs of average cut-rank at most 3∕2 and determine up to 3∕2 all possible values that can be realized as the average cut-rank of some graph
URI
https://pr.ibs.re.kr/handle/8788114/7530
DOI
10.1016/j.ejc.2020.103183
ISSN
0195-6698
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse