Difficulties in friendships have been reported both in people with Autism Spectrum Disorder (ASD) and in individuals with Anorexia Nervosa (AN). This small-scale qualitative study aimed to evaluate the friendship experiences of seven patients with AN who presented with possible ASD traits; to determine whether their experiences were reflective of those found in people with ASD, and whether any ...

The explosive growth of social networks in recent times has presented a powerful source of information to be utilized as an extra source for assisting in the social recommendation problems. The social recommendation methods that are based on probabilistic matrix factorization improved the recommendation accuracy and partly solved the cold-start and data sparsity problems. However, these methods...

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

This position paper explores the dual nature of friendship relations as an enabler but also as a pitfall for privacy in social networks. The privacy-deteriorating consequences of unilateral friendship disclosure are quantified for an existing medium-sized social network site. A lightweight implementation of hidden friendship using existing standards is proposed and assessed for practicable and ...

Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us3 is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and...

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best poss...

The process by which new ideas, innovations, and behaviors spread through a large social network can be thought of as a networked interaction game: Each agent obtains information from certain number of agents in his friendship neighborhood, and adapts his idea or behavior to increase his benefit. In this paper, we are interested in how opinions, about a certain topic, form in social networks. W...

We introduce nite relational structures called sketches, that represent edge crossings in drawings of nite graphs. We consider the problem of characterizing sketches in Monadic Second-Order logic. We answer positively the question for framed sketches, i.e., for those representing drawings of graphs consisting of a planar connected spanning subgraph (the frame) augmented with additional edges th...

Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak), where ai is the number of edges incident to v with color i. Reorder c̄(v) for every v in G in nonincreasing order to obtain c∗(v), the color-blind partition of v. When c∗ induces a proper vertex coloring, that is, c∗(u) 6= c∗(v) for every edge uv in G, we say that c is col...