Cited By
View all- Vehlow CBeck FWeiskopf D(2017)Visualizing Group Structures in GraphsComputer Graphics Forum10.1111/cgf.1287236:6(201-225)Online publication date: 1-Sep-2017
The n -vertex graph G ( = ( G ) ) with a non-singular real symmetric adjacency matrix G , having a zero diagonal and singular ( n - 1 ) ( n - 1 ) principal submatrices is termed a NSSD, a Non-Singular graph with a Singular Deck. NSSDs arose in the study ...
Trustworthiness is a field of research that seeks to estimate the credibility of information by using knowledge of the source of the information. The most interesting form of this problem is when different pieces of information share sources, and when ...
Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n1, Vk={v1,,vk} is a subset of the vertex set of F and Hv is a simple graph of order m2, v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge-...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in