DocumentCode
635846
Title
Applications of realizable Boolean matrices in graph theory
Author
Feng Sun ; Xiao-Bing Qu ; Tian-Fei Wang ; Xue-ping Wang
Author_Institution
Coll. of Math. & Inf. Sci., Leshan Normal Univ., Leshan, China
fYear
2013
fDate
24-28 June 2013
Firstpage
843
Lastpage
847
Abstract
This paper gives some applications of realizable Boolean matrices in graph theory. We apply realizable Boolean matrices to characterize clique, maximal clique, maximum clique and clique cover in graph theory. Particularly, we prove that the content of a realizable Boolean matrix is exactly the clique cover number of its corresponding undirected graph, and present algorithms to determine the content and a realizing matrix with minimum number of columns of a given realizable Boolean matrix and a minimum clique cover of an undirected graph, respectively.
Keywords
Boolean algebra; graph theory; matrix algebra; graph theory; maximal clique cover; maximum clique cover; realizable Boolean matrices; undirected graph; Educational institutions; Electronic mail; Graph theory; Information science; Matrix decomposition; Symmetric matrices; Clique; Clique cover; Content; Realizable Boolean matrix; Undirected Graph;
fLanguage
English
Publisher
ieee
Conference_Titel
IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), 2013 Joint
Conference_Location
Edmonton, AB
Type
conf
DOI
10.1109/IFSA-NAFIPS.2013.6608510
Filename
6608510
Link To Document