Let G be a finite group. For a fixed element g in G and a given subgroup X of G, the relative g-noncommuting graph of G is a simple undirected graph whose vertex set is G and two vertices x and y are adjacent if x ∈ X or y ∈ X and [x, y] = g, g −1 . We denote this graph by Γ g X,G . In this paper, we obtain computing formulae for degree of any vertex in Γ g X,G and characterize whether Γ g X,G is a tree, star graph, lollipop or a complete graph together with some properties of Γ g X,G involving isomorphism of graphs. We also present certain relations between the number of edges in Γ g X,G and certain generalized commuting probabilities of G which give some computing formulae for the number of edges in Γ g X,G . Finally, we conclude this paper by deriving some bounds for the number of edges in Γ g X,G .