Vertices of Attachment Question

  • MHB
  • Thread starter cept
  • Start date
In summary: Hope that helps!In summary, Tutte defines a vertex of attachment as a vertex of a graph that is incident with a edge that is not an edge of the graph. He also defines a set of vertices that are incident with an edge of a graph.
  • #1
cept
1
0
I am currently reading "Graph Theory" by Tutte.

Just to make sure I understand the definition of vertex of attachment:

By Tutte's definition, "A vertex of attachment of H in G is a vertex of H that is incident with some edge of G that is not an edge of H. We write W(G, H) for the set of vertices of attachment of H in G..."

So if have a graph G(V) = {A, B, C, D} and G(E) = {a, b, c} drawn below

A ..a... B ...b ...C
0 ----- 0 -------0
|
|c
|
0
D

and subgraph H of G, where H(V) = {A, B} and H(E) = {a}

A.. a ...B
0-------0

then the set of vertices of attachment is: W(G, H) = { B }

Tutte futher writes:"If H and K are subgraphs of G, let u write Q(G; H, K) for the set of all vertices x of G such that x belongs to W(G, H) and W(G, K) but not to W(G, H U K). Alternatively we may characterize x as incident with an edge of H not belonging to K and with an edge of K not belonging to H, but not incident with any edge of G outside both E(H) and E(K)."

I cannot picture this last statement.

QUESTION:
How can there be vertices of attachment that belong to W(G, H) and W(G, K), but not their union W(G, H U K)?? Thanks in advance,

Carlos
 
Physics news on Phys.org
  • #2
To answer your question, consider the following example. Let's say we have a graph G with vertices A, B, C, and D, and edges a, b, and c. Let's also say that we have two subgraphs H and K of G such that H is the subgraph containing vertices A and B, and edges a and b, and K is the subgraph containing vertices B and C, and edges b and c. In this case, W(G, H) = {B} and W(G, K) = {B}, so W(G, H U K) = {B}. However, there are no vertices in G that belong to both W(G, H) and W(G, K) but not W(G, H U K). This is because any vertex that belongs to W(G, H) must also belong to W(G, H U K), and similarly for W(G, K). So Q(G; H, K) = ∅.In other words, for a vertex x of G to belong to W(G, H) and W(G, K) but not W(G, H U K), x must be incident with an edge of H not belonging to K, and an edge of K not belonging to H, but not incident with any edge of G outside both E(H) and E(K).
 

FAQ: Vertices of Attachment Question

What is the "Vertices of Attachment Question"?

The "Vertices of Attachment Question" is a psychological assessment tool used to measure the quality of attachment between a child and their primary caregiver.

How is the "Vertices of Attachment Question" administered?

The "Vertices of Attachment Question" is typically administered through a series of questions or tasks that the child and caregiver complete together, such as playing a game or telling a story. The responses are then scored and analyzed to determine the attachment style.

What are the different attachment styles measured by the "Vertices of Attachment Question"?

The "Vertices of Attachment Question" measures four main attachment styles: secure, insecure-avoidant, insecure-anxious, and disorganized. These attachment styles are based on the child's behavior and emotional responses during the assessment.

What is the significance of measuring attachment styles?

Attachment styles can have a significant impact on a child's development and relationships throughout their life. By measuring attachment styles, psychologists can gain insight into the quality of a child's relationship with their primary caregiver and identify any areas that may need attention or intervention.

Can the "Vertices of Attachment Question" be used with adults?

No, the "Vertices of Attachment Question" is specifically designed for children. However, there are similar assessment tools that can be used to measure attachment in adults, such as the Adult Attachment Interview or the Relationship Scales Questionnaire.

Similar threads

Replies
1
Views
1K
Replies
1
Views
2K
Replies
11
Views
3K
Replies
1
Views
1K
Replies
1
Views
2K
Replies
22
Views
1K
Replies
1
Views
1K
Replies
2
Views
1K
Back
Top