What Graphs are 2-Dot Product Graphs?

نویسندگان

  • Matthew Johnson
  • Erik Jan van Leeuwen
  • Daniël Paulusma
چکیده

From a set of d-dimensional vectors for some integer d ≥ 1, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au · av ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. To understand the position of d-dot product graphs in the landscape of graph classes, we consider the case d = 2, and investigate how 2-dot product graphs relate to a number of other known graph classes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 51 1 . 05 00 9 v 1 [ m at h . C O ] 1 6 N ov 2 01 5 What Graphs are 2 - Dot Product Graphs ? ⋆

Let d ≥ 1 be an integer. From a set of d-dimensional vectors, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au · av ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. Recognizing a d-dot product graph is known to be NP-hard for...

متن کامل

A note on vague graphs

In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2015