Scribd
Upload
25 views

Signed Graph

Uploaded by

raikwarmrityunjaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Signed Graph

Uploaded by

raikwarmrityunjaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

MATHEMATICAL MODELING

SIGNED GRAPH:-

PRESENTED TO:- PRESENTED BY :-


Dr.Mrs.Mandira Kar Mam Archana Patel
M.sc. IVth sem
SIGNED GRAPH :-
DEFINITION:-

A signed (OR AN ALGEBRAIC) graph is one


in which every edge has a positive or
negative sign associated with it.

FOR EXAMPLE:-Let positive and negative


sign denote friendship and enemity
respectively.
a. a is a friend of both b and c and b and c are also
friends .
b. a is a friend of b and both a and b are jointly
enemies of c.
c. b is a friend of both a and c but a and c are enemies.
d. a is a enemy of both b and c but b and c are not
friends .
The first two graphs represents normal behaviour and
are said to be balanced ,while the last two graphs
represent unbalanced situations .

We define the sign of a cycle as the product of


component edges .
A cycle of length three or triangle is balanced if and
only if its sign is positive .

A complete algebraic graph is said to be complete


graph such that between any two edges of it,there is
a positive or negative sign.
A complete algebraic graph is said to be balanced if all
its triangles are balanced.

A graph is locally balanced at a point b if all the cycles


passing through b are balanced.
STEPS FOR IMPLEMENTATION:-
1. Create a graph with n nodes ,where the nodes are
the countries.
2. Make it a complete graph by adding all possible
edges. Also assign ‘+’ or ‘-’ signs as weight to all the
edges randomly.
3. Display the network.
4. Get a list of all the triangles.
5. Store the sign details of all the triangles.
6. Count the number of unstable traingles in the
network.
7. While the number of unstable triangle is not zero,Do
the following:-
• Choose the triangle in the graph that is unstable.
• Make the triangle stable.
• Count the number of unstable triangle.
8. when the network become stable ,it can be divided
into two coalition,such that in coalition ,the intra –
edge are positive, and the inter-edges are
negative.

• Choose a random node.add it to the first coalition


• Also put all the friends of this node in the first
coalition.
• Put all the enemies of this node in the second
coalition.
• Repeat steps for all unprocessed nodes of first
coalition.
9. Display the network with coalition.
ANTIBALANCE OF A GRAPH:-
An algebraic graph is said to be antibalance if every
cycle in it has even number of positive edges . This
can be done from that of a balance graph by
changing the signs of the edges .

An algebraic graph is antibalance if and only if its


vertices can be seperated into two disjoint classes.

Such that :- each negative edge join two vertices of


the same class and each positive edge joins
persons from different classes.
DUOBALANCE OF A GRAPH:-

Signed graph is said to be duobalance if it


is both balanced and antibalance.
THE DEGREE OF UNBALACE OF A
GRAPH:-

Cartwright and Harary define the degree of


balance of a group G to be ratio of the
positive cycles of G to the total numbers if
cycles in G .

This balance index lies between 0 and 1 .


FOR EXAMPLE:-
In the figures :- total number of nodes are fives ,it
means there are 10 triangles in both the figures.
FORMULA:-
TOTAL NUMBER OF TRAINGLE =

n(n-1)(n-2)=5(5-1)(5-2)
6 6
5.4.3 = 10
6
In G1 ,there are 6 negative triangles:-
(abe),(bcd),(bde),(cde),(dea) and (bec)
And 4 positive triangles:- (abc),(ace),(acd),(bda) .

In G2 , there are 4 negative triangles:-


(bce),(abd),(abc) and (bde) and 6 positive triangles.

The degree of balance of G1 is therefore less than the


degree of balance of G2 .

In order to get a balanced graph from G1 .we have to


change the sign of two edges viz. bc and de
from G2 .we have to change the sign of two edges viz.
bc and bd.

From this point of view G1 and G2 are equally


unbalanced.

Abelson and Rosenberg defined the degree of


unbalance of an algebraic graph “as the number of
the smallest set of edges of G whose change of sign
produces a balance graph”.
The degree of an antibalance complete algebraic
graph is given by [n(n-2)+k]/4 where
K=1 if n is odd and k=0 if n is even.
THANK YOU

You might also like