Back
 OJDM  Vol.7 No.3 , July 2017
Graphs with k-Role Assignments
Abstract: For a given graph G, a k-role assignment of G is a surjective function  such that , where N(x) and N(y) are the neighborhoods of x and y, respectively. Furthermore, as we limit the number of different roles in the neighborhood of an individual, we call r a restricted size k-role assignment. When the hausdorff distance between the sets of roles assigned to their neighbors is at most 1, we call r a k-threshold close role assignment. In this paper we study the graphs that have k-role assignments, restricted size k-role assignments and k-threshold close role assignments, respectively. By the end we discuss the maximal and minimal graphs which have k-role assignments.

1. Introduction and Preliminary

Role assignments, introduced by Everett and Borgatti [1] , who called them role colorings, formalize the idea, arising in the theory of social networks, that individuals of the same social role will relate in the same way to individuals playing counterpart roles.

Let G be a graph with vertices representing individuals and edges representing relationships. For any vertex v V ( G ) , the neighborhood N G ( v ) = N ( v ) of vertex v is the set of all vertices adjacent to v in G. Let r : V ( G ) Z , where Z is the set of positive integers. For S V ( G ) , denote r ( S ) = { r ( x ) : x S } and G [ S ] be the subgraph of G induced by set S. For any i Z , r 1 ( i ) = { v V ( G ) : r ( v ) = i } . The function r is a role assignment if

r ( x ) = r ( y ) r ( N ( x ) ) = r ( N ( y ) ) . (1)

*Corresponding author.

In other words, in a role assignment, if two individuals have the same role, they are related to individuals with the same sets of roles. A k-role assignment for graph G is a role assignment r so that r ( V ( G ) ) = { 1,2, , k } . We say that G is k-role assignable if it has a k-role assignment.

Pekeč and Roberts [2] proposed a modification of the role assignment model, which would limit the number of different roles in the neighborhood of an individual. This limit could be different for different individuals or could be uniform for the network. For a group of nonnegative integers s 1 , s 2 , , s k , we define a restricted size k-role assignment r of a graph G to be a k-role assignment in which | r ( N ( v ) ) | s i must hold for all v r 1 ( i ) . When s 1 = s 2 = = s k = s , we call the restricted size k-role assignment a restricted s-size k-role assignment, i.e., a k-role assignment in which | r ( N ( v ) ) | s must hold for all v V ( G ) .

If S and T are two sets of real numbers, let the distance d ( S , T ) be defined by d ( S , T ) = m i n { | s t | : s S , t T } , with d ( S , ) = if S and 0 other- wise. For a given graph G, we say the function r from V ( G ) into the set of positive integers is a threshold role assignment (Roberts [3] ) if

r ( x ) = r ( y ) d ( r ( N ( x ) ) , r ( N ( y ) ) ) 1. (2)

If r ( V ( G ) ) = { 1,2, , k } , we say r is a k-threshold role assignment.

Roberts [3] also introduced an alternative definition of distance, the Hausdorff distance d h , d h ( S , T ) = m a x { m a x x S d ( x , T ) , m a x x T d ( x , S ) } , By convention d h ( S , ) = if S and 0 otherwise. For a given graph G, we say the function r from V ( G ) into the set of positive integers is a threshold close role assignment (Roberts [3] ) if

r ( x ) = r ( y ) d h ( r ( N ( x ) ) , r ( N ( y ) ) ) 1. (3)

If r ( V ( G ) ) = { 1,2, , k } , we say r is a k-threshold close role assignment. If such an assignment exists, we say G is k-threshold close role assignable.

A graph with n 3 vertices is role primitive if it has no k-role assignment for 2 k n 1 . Roberts and Sheng [4] studied it for a special class graphs called indifference graphs.

A good survey about role assignment is [5] . Recently, many new papers related to role assignment appeared, see [6] [7] [8] . All the graphs in the paper are simple graphs. In Section 2 we give a characterization of graphs that are k-role assignable. In Section 3 we study the restricted k-role assignable graphs and characterize the graphs that are restricted size k-role assignable or restricted s-size k-role assignable. In Section 4 we discuss the graphs that are k-threshold close role assignable. In Section 5 we discuss the maximal and minimal k-role assignable graphs.

2. k-Role Assignable Graphs

The assignment r ( x ) 1 for any vertex x V ( G ) is a role assignment if and only if the graph has no isolated vertices or all isolated vertices, so this describes the graphs which are 1-role assignable. The assignment where r ( x ) is different for each vertex x V ( G ) is always a role assignment, so every graph of n vertices is n-role assignable. The other cases are not straightforward.

The 2-role assignable graphs are the first interesting class of graphs. Roberts and Sheng [9] showed that the problem of determining if G has a 2-role assign- ment is NP-complete. Sheng [10] characterized 2-role assignable indifference graphs and extended some results about indifference graphs to the broader class of triangulated graphs. For the general case, we have the following results.

Theorem 1 Let G be a graph and S a proper subset of V ( G ) . If S satisfies the following properties:

| S | = k 1 ,

G S has no isolated vertices or all isolated vertices, and

• for any v S , N ( v ) ( V ( G ) \ S ) = or V ( G ) \ S .

Then G is k-role assignable.

Proof. We give an assignment r for G by assigning each role of { 1,2, , k 1 } to one vertex of S and k to all vertices of G S . The following is to verify that r is a k-role assignment of G. In fact, we just need to check the vertices with role k. By property (3), we may assume that S = S 1 S 2 and S 1 S 2 = , where S 1 = { v S : N ( v ) ( V ( G ) \ S ) = V ( G ) \ S } and S 2 = { v S : N ( v ) ( V ( G ) \ S ) = } . For any vertex v V ( G ) \ S , since N ( v ) = S 1 N G S ( v ) , then

r ( N ( v ) ) = { r ( S 1 ) { k } , if G S has no isolated vertices , r ( S 1 ) , if all vertices of G S are isolated vertices .

So r is a k-role assignment of G in each case. The proof is complete.

Theorem 2 A graph G with at least k vertices has a k-role assignment if and only if V ( G ) can be partitioned into k nonempty sets V 1 , V 2 , , V k , and the following two properties are satisfied.

G [ V i ] has no isolated vertices or all isolated vertices, where i = 1 , 2 , , k , and

• for each i { 1,2, , k } , there exist k i sets V i 1 , V i 2 , , V i k i { V 1 , V 2 , , V k } , where 0 k i k , such that for any x V i , N ( x ) V i j when j = 1 , 2 , , k i , and N ( x ) V j = when j i 1 , i 2 , , i k i .

Proof. Let r be a k-role assignment of graph G and r 1 ( i ) = V i , in which i = 1 , 2 , , k . Then it is obvious that V ( G ) is partitioned into k nonempty sets V 1 , V 2 , , V k . For any x V i , if i r ( N ( x ) ) , then G [ V i ] has no isolated vertices; if i r ( N ( x ) ) , then all vertices of G [ V i ] are isolated vertices. For any x V i , let k i = | r ( N ( x ) ) | , then there exist k i sets V i 1 , V i 2 , , V i k i { V 1 , V 2 , , V k } , where 0 k i k , such that for any x V i , N ( x ) V i j when j = 1 , 2 , , k i , and N ( x ) V j = when j i 1 , i 2 , , i k i .

On the converse case we suppose V ( G ) can be partitioned into k nonempty sets V 1 , V 2 , , V k , and G satisfies the two properties mentioned in the theorem. Let r ( V i ) = i for i = 1 , 2 , , k . Then it is easy to check that r is a k-role assign- ment of graph G.

Roberts and Sheng [9] did some work on 2-role assignable graphs. For k = 2 , Sheng [10] have studied the indifference graphs and triangulated graphs. For k = n 1 , we also have the following result.

Theorem 3 A graph G with n vertices has a ( n 1 ) -role assignment if and only if there exist x , y V ( G ) such that N ( x ) \ { y } = N ( y ) \ { x } .

Proof. Let r be a ( n 1 ) -role assignment of G. Since | V ( G ) | = n , there must be two vertices x and y with the same role, i.e., r ( x ) = r ( y ) = k , where 1 k n 1 , and each of the other vertices have unique roles. Because r ( N ( x ) ) = r ( N ( y ) ) , if x is not adjacent to y, then N ( x ) = N ( y ) , and N ( x ) \ { y } = N ( y ) \ { x } is obvious; if x is adjacent to y, then N ( x ) \ { y } = N ( y ) \ { x } .

If there are two vertices x and y satisfying N ( x ) \ { y } = N ( y ) \ { x } , then let r ( x ) = r ( y ) = 1 , and the r values of the other n 2 vertices are 2,3, , n 1 respectively. It is easy to see that r is a ( n 1 ) -role assignment of graph G.

3. Restricted k-Role Assignable Graphs

In this section we study the restricted size k-role assignment and the restricted s-size k-role assignment of a graph G. It is easy to see that any k-role assignment of graph G is a restricted k-size k-role assignment. So we may assume in the following that 0 s k and 0 s i k , in which i = 1 , 2 , , k .

Pekeč and Roberts [2] just discussed the restricted s-size k-role assignment for the special case when s = 1 , i.e., when everyone in the neighborhood of an individual should be assigned the same role. They showed that G has a restricted 1-size k-role assignment if and only if k c ( G ) + b ( G ) , where c ( G ) is the number of connected components of G and b ( G ) is the number of connected components of G that are bipartite but not isolated vertices. In particular, a connected graph G on at least two vertices has a restricted 1-size 2-role assignment if and only if G is bipartite. For the restricted size k-role assignment, we have the following result.

Theorem 4 For k nonnegative integers s 1 , s 2 , , s k , a graph G with at least k vertices has a restricted size k-role assignment if and only if V ( G ) can be partitioned into k nonempty sets V 1 , V 2 , , V k , and the following two properties are satisfied.

G [ V i ] has no isolated vertices or all isolated vertices, where i = 1 , 2 , , k , and

• for each i { 1,2, , k } , there exist t i sets V i 1 , V i 2 , , V i t i { V 1 , V 2 , , V k } , where 0 k i s i , such that for any x V i , N ( x ) V i j when j = 1 , 2 , , t i , and N ( x ) V j = when j i 1 , i 2 , , i t i .

Proof. For k nonnegative integers s 1 , s 2 , , s k , let r be a restricted size k-role assignment of graph G and r 1 ( i ) = V i . Then we have | r ( N ( v ) ) | s i for all v V i , in which i = 1 , 2 , , k . The following is similar to the proof of Theorem 2.

When s 1 = s 2 = = s k = s , we have the following corollary for the restricted s-size k-role assignment.

Corollary 1 A graph G with at least k vertices has a restricted s-size k-role assignment if and only if V ( G ) can be partitioned into k nonempty sets V 1 , V 2 , , V k , and the following two properties are satisfied.

G [ V i ] has no isolated vertices or all isolated vertices, where i = 1 , 2 , , k , and

• for each i { 1,2, , k } , there exist t i sets V i 1 , V i 2 , , V i t i { V 1 , V 2 , , V k } , where 0 t i s , such that for any x V i , N ( x ) V i j when j = 1 , 2 , , t i , and N ( x ) V j = when j i 1 , i 2 , , i t i .

4. k-Threshold Close Role Assignable Graphs

Roberts [3] showed that every graph G has a k-threshold role assignment for every 2 k | V ( G ) | . Roberts [3] [11] showed that every graph with k or more vertices is k-threshold close role assignable for the cases k = 2 , 3 , 4 and 5.

Let [ 1, d + 1 ] denote the set of all positive integers less or equal to d + 1 and the diameter of a graph G be defined as

diam G = m a x { d ( x , y ) : x , y V ( G ) } . (4)

Then we have the following result.

Theorem 5 Given a connected graph G. If diam G = d , then G is k-threshold close role assignable for any k [ 1, d + 1 ] .

Proof. Without loss of generality, we may assume that there are two vertices x , y V ( G ) such that diam G = d ( x , y ) = d , i.e., x and y are the endpoints of some path of G. We partition V ( G ) into d + 1 nonempty sets V 1 , V 2 , , V d + 1 by the following way: Let

V 1 = { x } and V i = { v : d ( x , v ) = i 1 } , where i = 2 , 3 , , d + 1. (5)

Then it is easy to see that y V d + 1 and the following properties are valid.

i = 1 d + 1 V i = V ( G ) ,

V i V j = , when i j , and

• for any v V i , N ( v ) V i 1 and N ( v ) V j = , where j = 1 , 2 , , i 2 , i + 2 , i + 3 , , d , d + 1 .

Note that N ( v ) V i + 1 may be null or not.

Now we construct other d + 1 nonempty sets V 1 * , V 2 * , , V d + 1 * from V 1 , V 2 , , V d + 1 . Let

V i * = ( V i \ H i ) H i + 1 and V d + 1 * = V d + 1 , i = 1 , 2 , , d , (6)

in which H 1 = , H d + 1 = and

H i = { v : v is an isolated vertex of G [ V i ] and N ( v ) V i + 1 = } , i = 2 , 3 , , d .

Then i = 1 d + 1 V i * = V ( G ) , V i * V j * = when i j , and for any vertex v V i * ,

the neighborhood N ( v ) must be one of the following four cases.

N ( v ) V i * = , N ( v ) V i + 1 * , N ( v ) V i 1 * ,

N ( v ) V i * , N ( v ) V i 1 * = , N ( v ) V i + 1 * = ,

N ( v ) V i * , N ( v ) V i 1 * , N ( v ) V i + 1 * = ,

N ( v ) V i * , N ( v ) V i 1 * , N ( v ) V i + 1 * .

Then, for any k [ 1, d + 1 ] , let r ( V i * ) = i for i = 1 , 2 , , k , and r ( V j * ) = k for j = k + 1 , k + 2 , , d + 1 . Then r ( N ( v ) ) = { k } for any vertex v i = k + 1 d + 1 V i * . For any vertex v V k * , r ( N ( v ) ) must be { k } or { k 1, k } . For any vertex v V i * where i = 1 , 2 , , k 1 , since N ( v ) is in one of the four cases above, r ( N ( v ) ) must be one of the following four sets: { i 1, i + 1 } , { i } , { i 1, i } and { i 1, i , i + 1 } . Thus it is easy to see that d h ( r ( N ( u ) ) , r ( N ( v ) ) ) 1 for any two vertices u and v with same role, i.e., r is a k-threshold close role assignment of G. The proof is complete.

Corollary 2 Any graph that has no isolated vertices or all isolated vertices is k-threshold close role assignable for any k [ 1, d + ω ] , where d = d 1 + d 2 + + d ω , ω is the number of components of G and d i is the diameter of each component of G, i = 1 , 2 , , ω .

Proof. When all vertices of G are isolated vertices, the result is obvious. Now we assume that G has no isolated vertices and that G 1 , G 2 , , G ω are the connected components of G. For each G i , we define V i j * as V j * for G in Theorem 5, where j { 1,2, , d i + 1 } . Furthermore, we order them as follows:

V 11 * , V 12 * , , V 1 ( d 1 + 1 ) * , V 21 * , V 22 * , , V 2 ( d 2 + 1 ) * , V 31 * , V 32 * , , V ω ( d ω + 1 ) * .

For any k [ 1, d + ω ] , we assign all the vertices of the ith set in above sequence with role i, where 1 i k , and assign all vertices of the other sets with role k. Then the result is valid by the similar discussion in Theorem 5.

The following three results are immediate from Theorem 5.

Corollary 3 Any path with n vertices is k-threshold close role assignable for any k [ 1, n ] .

Corollary 4 Any tree whose longest path has t vertices is k-threshold close role assignable for any k [ 1, t ] .

Corollary 5 Any cycle with n vertices is k-threshold close role assignable for

any k [ 1, n + 1 2 ] .

Remark. Any cycle C with n vertices is k-threshold close role assignable for any k [ 1, n ] . In fact, let

v 1 , v 3 , v 5 ,, v n 1 , v n , v n 2 , , v 4 , v 2 , ( n even )

or

v 1 , v 3 , v 5 , , v n 2 , v n , v n 1 , , v 4 , v 2 . ( n odd )

be the n vertices of C in clockwise order. For any k [ 1, n ] , let r ( v i ) = i for any i = 1,2, , k , r ( v k + 1 ) = k 1 and r ( v j ) = k for j = k + 2 , k + 3 , , n . Then it is easy to see that r is a k-threshold close role assignment of C.

5. Maximal and Minimal k-Role Assignable Graphs

Suppose graph G with n vertices is k-role assignable. We may add (or delete) edges on G to get a complete (or empty) graph G . It is easy to see that G is k-role assignable too. So we can maximize or minimize the graph G and keep r ( N ( x ) ) fixedness for any x V ( G ) such that the resulting graph is still k-role assignable.

For a given k-role assignment r of graph G, the maximal (minimal, respectively) k-role assignable graph respect to r, denoted by G r + ( G r , respectively), is the graph that will get by the following ways.

If V i = r 1 ( i ) , where i = 1,2, , k , we may use the following ways to get G r + .

• If G [ V i ] has no isolated vertices, then add some edges to join each pair of vertices unconnected in V i , where i = 1,2, , k .

• If x y E ( G ) , where x V i and y V j , i , j { 1,2, , k } , then add some edges on graph G such that each vertex of V i joins with every vertex of V j .

We may also use the following ways to get G r .

• If G [ V i ] has no isolated vertices, then delete some edges of G [ V i ] at mostly and keep G [ V i ] without any isolated vertex, where i = 1 , 2 , , k .

• If x y E ( G ) , where x V i and y V j , i , j { 1,2, , k } , then delete some edges between V i and V j at mostly but keeping N ( x ) V j for any x V i and N ( y ) V i for any y V j .

By the ways of constructing G r + and G r , the following theorem is obvious.

Theorem 6 If a graph G is k-role assignable, then both G r + and G r are all k-role assignable. Furthermore, G r + ( G r , respectively) is the maximal (mini- mal, respectively) k-role assignable graph such that r ( N ( x ) ) keeps fixedness for any x V ( G ) , where r is some k-role assignment of graph G.

Acknowledgements

We thank the editor and the referee for their valuable comments. The work was supported in part by the Natural Science Foundation of Hebei Province of China under Grant A2015106045, and in part by the Institute of Applied Mathematics of Shijiazhuang University.

Cite this paper: Liu, Y. and Zhao, Y. (2017) Graphs with k-Role Assignments. Open Journal of Discrete Mathematics, 7, 177-184. doi: 10.4236/ojdm.2017.73016.
References

[1]   Everett, M.G. and Borgatti, S. (1991) Role Colouring a Graph. Mathematical Social Sciences, 21, 183-188.
https://doi.org/10.1016/0165-4896(91)90080-B

[2]   Pekec, A. and Roberts, F.S. (2001) The Role Assignment Model Nearly Fits Most Social Networks. Mathematical Social Sciences, 41, 275-293.
https://doi.org/10.1016/S0165-4896(00)00064-0

[3]   Roberts, F.S. (1998) Role Assignments and Indifference Graphs. In: Dowing, C., Roberts, F.S. and Theuns, P., Eds., Recent Trends in Mathematical Psychology, Lawrence Erlbaum Associates, Mahwah, 33-46.

[4]   Roberts, F.S. and Sheng, L. (1996) Role Primitive Indifference Graphs and the Role Assignments on w-Fan Graphs. Congressus Numerantium, 121, 65-75.

[5]   Roberts, F.S. and Sheng, L. (1999) Role Assignments. In: Alavi, Y., Lick, D.R. and Schwenk, A., Eds., Combinatorics, Grsph Theory, and Algorithms, Vol. 2, New Issues Press, Kalamazoo, 729-745.

[6]   Van’t Hof, P., Paulusma, D. and Van Rooij, J.M.M. (2010) Computing Role Assignments of Chordal Graphs. Theoretical Computer Science, 411, 3601-3613.

[7]   Heggernes, P., Van’t Hof, P. and Paulusma, D. (2012) Computing Role Assignments of Proper Interval Graphs in Polynomial Time. Journal of Discrete Algorithms, 14, 173-188.
https://doi.org/10.1016/j.jda.2011.12.004

[8]   Dourado, M.C. (2016) Computing Role Assignments of Split Graphs. Theoretical Computer Science, 635, 74-84.
https://doi.org/10.1016/j.tcs.2016.05.011

[9]   Roberts, F.S. and Sheng, L. (2001) How Hard Is It to Determine if a Graph Has a 2-Role Assignment. Networks, 37, 67-73.
https://doi.org/10.1002/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9

[10]   Sheng, L. (2003) 2-Role Assignments on Triangulated Graphs. Theoretical Computer Science, 304, 201-214.
https://doi.org/10.1016/S0304-3975(03)00084-7

[11]   Roberts, F.S. and Sheng, L. (1997) Threshold Role Assignments. Congressus Numerantium, 123, 135-148.

 
 
Top