11 research outputs found

    On the Intersection Power Graph of a Finite Group

    Full text link
    Given a group G, the intersection power graph of G, denoted by GI(G)\mathcal{G}_I(G), is the graph with vertex set G and two distinct vertices x and y are adjacent in GI(G)\mathcal{G}_I(G) if there exists a non-identity element z∈Gz\in G such that x^m=z=y^n, for some m,n∈Nm, n\in \mathbb{N}, i.e. x∼yx\sim y in GI(G)\mathcal{G}_I(G) if ⟨x⟩∩⟨y⟩≠{e}\langle x\rangle\cap \langle y\rangle \neq \{e\} and ee is adjacent to all other vertices, where ee is the identity element of the group G. Here we show that the graph GI(G)\mathcal{G}_I(G) is complete if and only if either G is cyclic p-group or G is a generalized quaternion group. Furthermore, GI(G)\mathcal{G}_I(G) is Eulerian if and only if |G| is odd. We characterize all abelian groups and also all non-abelian p-groups G, for which GI(G)\mathcal{G}_I(G) is dominatable. Beside, we determine the automorphism group of the graph GI(Zn)\mathcal{G}_I(\mathbb{Z}_n), when n≠pmn\neq p^m

    Soft-WSN: Software-Defined WSN Management System for IoT Applications

    No full text
    corecore