ABSTRACT

 An incidence graph of a given graph G, denoted by I(G) , has its vertex set VIG=v,e:v∈VG,e∈EGand v is incident to e in G such that the pair (u,e)(v,f)∈V(IG) is an edge of I(G))if and only if there exists at least one case of u=v,e=f,uv=f. Incidence graphs was studied by byZhagn Zhong-fu et.al in [3]. The origin of Incidence graphs can be traced to a paper titled Incidence and Strong edge colorings of graphs by R.A.Brualdi,et.al [7] . In this paper, we study some general properties of degree related inequalities, connectedness, matching   and related parameters on Incidence graphs.

 Keywords: Incidence graphs, Independence number,Matching