It contains all the information about graph theory related to software testing

Attribution Non-Commercial (BY-NC)

10 views

It contains all the information about graph theory related to software testing

Attribution Non-Commercial (BY-NC)

- 2010 sub
- Graph Theory and Its Applications to Problems of Society
- Graph Theory & Combinatorics July 2011
- Azure Cosmos Db 2-Cheat Sheet v4-Letter
- Discrete Mathematics syllabi
- PS5 Draft
- Stream Mining Thesis
- Structural Complexity of Minerals Information Stor
- 2010 PMWC Tryouts Problems
- SSGQ
- 1204.0Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information867v1
- Text Rank
- Understanding Voronoi scipy
- Programs (Sheet)
- Binding Number of Some Special Classes of Trees
- graph representation
- Unit1-KG
- 9
- Intro Networks
- Yan_Leader-following Consensus of Multi-Agent Systems With And

You are on page 1of 23

Graph theory?

Has nothing to do with graph or graphics An area of math dealing with entities (nodes) and the connections (links) between the nodes

V={n1, n2,nm} of nodes E={e1,e2,em} of edges

e1

n1

n2 e4

e2

n3

e3

n4

n5

e5

n7 n6

The degree

Refers to the number of edges that have a node as an endpoint , denoted by deg(n) Indicates the extent of integration testing that is appropriate for the object E.g. deg(n1) =2

Alternative to visual presentation of graph The incidence matrix of G=(V,E) with m nodes and n edges is an mn matrix We have 1 in row i, column J

if node i is an endpoint of edge j Row sum represents degree of nodes Column sum represents the endpoints of an edge

n1 n2 n3 n4 n5 n6 n7

e1 1 1 0 0 0 0 0

e2 1 0 0 1 0 0 0

e3 0 0 1 1 0 0 0

e4 0 1 0 0 1 0 0

e5 0 0 0 1 0 1 0

7

A useful supplement to the incidence matrix The Adjacency matrix of G=(V,E) with m nodes and n edges is an mm matrix

We have 1 in row i, and col. j if

there is an edge between node i and node j, zero otherwise

Used to identify paths and hence equivalence relation to simplify a graph and hence testing

8

n1 n2 n3 n4 n5 n6 n7

n1 0 1 0 1 0 0 0

n2 1 0 0 0 1 0 0

n3 0 0 0 1 0 0 0

n4 1 0 1 0 0 1 0

n5 0 1 0 0 0 0 0

n6 0 0 0 1 0 0 0

n7 0 0 0 0 0 1 0

9

A path is a sequence of edges such that, for any adjacent pair of edges ei, ej in the sequence, the edges share a common (node) endpoint Can be described as sequences of edges or nodes

path

Between n1 and n5 Between n6 and n5 .

Nodes sequence

n1,n2,n5 n6, n4, n1, n2, n5

Edge sequences

e1,e4 e5,e2,e1,e4

10

Nodes ni and nj are connected if they are in the same path Connectedness is an equivalence relation can be checked easily

Reflexive (every node is in path of 0 length with itself) Symmetric n1, and n2 in same path, then n2 and n1 is also in the same path transitive

11

Connectedness defines a partition (or component) on the node set of a graph Components of a graph is maximal set of connected nodes E.g. Components

Condensation graph Used as a Simplification mechanism Creating a graph by replacing a set of connected nodes (or components) by a condensing node The implication for testing is that component are stand alone elements and hence can be tested separately

S1={n1,n2,n3,n4,n5,n6} and S2={n7}

12

Edges have individual nodes as endpoints, not sets of nodes A possible edge would mean that nodes from two different components are connected, thus in a path, thus in the same component.

13

A directed graph D = (V,E) consists of a finite set V = {n1,., nm} of nodes, and a set E = {e1, e2, ,ep}, where each edge ek = <ni, nj> is an ordered pair of nodes.

14

n1 e2

e1

n2 e4

e3 n3

n4 e5

n5

n7

n6

15

The in degree of a node in a directed graph is the number of distinct edges that have the node as a terminal node.

The out-degree of a node in a directed graph is the number of distinct edges that have the node as a start point.

16

The AMD of G=(V,E) with m nodes is an mm matrix where a(i,j) is a 1 if there is an edge from node i to node j, otherwise it is 0

Row sum represents outdegrees Column sum represents indegrees

17

n1 n2 n3 n4 n5 n6 n7

n1 0 0 0 0 0 0 0

n2 1 0 0 0 0 0 0

n3 0 0 0 0 0 0 0

n4 1 0 1 0 0 0 0

n5 0 1 0 0 0 0 0

n6 0 0 0 1 0 0 0

n7 0 0 0 0 0 0 0

18

Source node: a node with in-degree zero Sink node: a node with out-degree=0

Transfer node: node with in-degree 0 and out-degree 0

19

Directed path (a sequence of edges ei and ej, the terminal node of ei is the initial node of ej ) Cycle (directed path that begins and ends at the same node) Directed semi-path (for adjacent pair of ei, the initial (terminal) node of the first edge is the initial (terminal) node of the second edge

E.g., n1 and n3

20

n1 n2 n3 n4 n5 n6 n7

n1 1 0 0 0 0 0 0

n2 1 1 0 0 0 0 0

n3 0 0 1 0 0 0 0

n4 1 0 1 1 0 0 0

n5 1 1 0 0 1 0 0

n6 1 0 1 1 0 1 0

n7 0 0 0 0 0 0 1

21

0-connected (no path between ni, and nj) 1-connected (semi-path between ni, and nj ) 2-connected(a path between ni, and nj ) 3-connected (a path between ni to nj, and a path between nj, and ni)

Strong components

22

n1 e2

e1

n2 e4

e3 n3

n4 e5

e6

n6

n7

n1 and n6 2-c

n3 and n6 3-c

23

- 2010 subUploaded byandrew0128
- Graph Theory and Its Applications to Problems of SocietyUploaded byT Sai Teja
- Graph Theory & Combinatorics July 2011Uploaded byPrasad C M
- Azure Cosmos Db 2-Cheat Sheet v4-LetterUploaded byStewart Henderson
- Discrete Mathematics syllabiUploaded byAkkayya Naidu Bonu
- PS5 DraftUploaded byLee Gao
- Stream Mining ThesisUploaded bySheena Lee
- Structural Complexity of Minerals Information StorUploaded byLuis Martins
- 2010 PMWC Tryouts ProblemsUploaded byLe Thu Hang
- SSGQUploaded byNitish Upreti
- 1204.0Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information867v1Uploaded byajaipaulose
- Text RankUploaded byDiana Kate
- Understanding Voronoi scipyUploaded bybalcanera
- Programs (Sheet)Uploaded byHaider Ali
- Binding Number of Some Special Classes of TreesUploaded byMia Amalia
- graph representationUploaded bymanishbhardwaj8131
- Unit1-KGUploaded byKarthikeyan Ramajayam
- 9Uploaded byMariana Santana
- Intro NetworksUploaded byayysse04
- Yan_Leader-following Consensus of Multi-Agent Systems With AndUploaded byDvid L Cruz
- Graph AlgorithmsUploaded byBodoShow
- Cycle Space 2Uploaded byHamdunah Nasution
- heheheUploaded byRohan Sharma
- PS4-22.pdfUploaded bycyrcos
- Using variants of zero forcing to bound the inertia set of a grap.pdfUploaded byDanang Stwn
- v3.Si1 .23.Inverse Domination of Divisor Cayley GraphsUploaded byJeelani.S
- patrolUploaded byjastine mago
- GamesUploaded byEpic Win
- Computer Networks Manual- 4 YearUploaded bycomputerstudent
- 2Uploaded byLuis Alberto Fuentes

- Iitial pages of SIMULATION OF NETWORK PROTOCOLSUploaded bytanyananda
- File of SIMULATION OF NETWORK PROTOCOLSUploaded bytanyananda
- Cover Page of SIMULATION OF NETWORK PROTOCOLSUploaded bytanyananda
- Java Pracs 2012Uploaded bytanyananda
- travel n tour Project ReportUploaded bytanyananda
- presentation on tours and travels projectUploaded bytanyananda

- POM - Assignment 2 - Nov 2015Uploaded bySaima Jafari
- COMP java practice assignmentUploaded byjack3db3rt
- 2012 Park N. Computer Education s Teaching Learning Methods Using Educational Programming Language Based on STEAM EducationUploaded byJose Gallardo A
- 7Uploaded byManjunath Achari
- ViiUploaded byRaghav Rathi
- May2003 ExamPUploaded byebtrain
- Recent Results in Independence DominationUploaded bychithu1234
- ruswpob.pdfUploaded byAnonymous MqprQvjEK
- Ex 5 SolutionsUploaded bySanjeev Shukla
- Quantitative techniques final as @ 4 May 2005.docUploaded bygsgopalsamy
- double spherical pendulum.pdfUploaded bycrguntalilib
- FFT Basics and Case Study Using Multi-Instrument D1002Uploaded byPerti Man
- TOE 2012 Assg-1Uploaded byRon Jacob
- P-groupsUploaded byWállef Silva
- 11-rough numberUploaded byGmz Virgo
- NTSE STAGE 2 - MAT SOLUTION-2009Uploaded byNilesh Gupta
- [Edward de Bono] Water LogicUploaded byIon-Tudor Rusu
- Chapter 3 Part 1Uploaded bySyihabuddin Yusoff
- Curvilinear CoordinatesUploaded byali_naghedifar
- MIT24 244S15 IdentityUploaded byDamla Nihan Yildiz
- Imo Level1 Class 3 Set 2Uploaded byprosenjit basak
- Wilson Fermat EjercicioUploaded byJuancho Parra
- Zh 05110257261Uploaded byAlion
- SANDS_Clark.pdfUploaded bymanusansano
- smith emily -grade 1 creating colour integrated unit planUploaded byapi-280000855
- Bayesian-Statistics Final 20140416 3Uploaded bymuralidharan
- Statistics and ProbabilityUploaded byishaq_ahmed_9
- Syllabus bookUploaded byNazeeruddin Mohammed
- Exponent LogarithmUploaded byRahul Saple
- Applications-of-HCF-and-LCM-to-Problem-Solving-Loreto-Abbey-Dalkey.pptxUploaded byPrachi Shukla