The Intersection Graph of Subgroups of the Dihedral Group of Order 2pq

For a finite group G, the intersection graph of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph of subgroups of the dihedral group for distinct primes . We also find the mean distance of the graph .

Structure of intersection graphs

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>

The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering

In this paper, we study the largest component of the near-critical random intersection graph G n , m , p with n nodes and m elements, where m = Θ n which leads to the fact that the clustering is tunable. We prove that with high probability the size of the largest component in the weakly supercritical random intersection graph with tunable clustering on n vertices is of order n ϵ n , and it is of order ϵ − 2 n log n ϵ 3 n in the weakly subcritical one, where ϵ n ⟶ 0 and n 1 / 3 ϵ n ⟶ ∞ as n ⟶ ∞ .

Some Topological and Polynomial Indices (Hosoya and Schultz) for the Intersection Graph of the Subgroup of〖 Z〗_(r^n )

Let be any group with identity element (e) . A subgroup intersection graph of a subset is the Graph with V ( ) = - e and two separate peaks c and d contiguous for c and d if and only if , Where is a Periodic subset of resulting from . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of , where , is aprime number.

On the Helly Property of Some Intersection Graphs

An EPG graph G is an edge-intersection graph of paths on a grid. In this thesis, we analyze structural characterizations and complexity aspects regarding EPG graphs. Our main focus is on the class of B1-EPG graphs whose intersection model satisfies well-known the Helly property, called Helly-B1-EPG. We show that the problem of recognizing Helly-B1-EPG graphs is NP-complete. Besides, other intersection graph classes such as VPG, EPT, and VPT were also studied. We completely solve the problem of determining the Helly and strong Helly numbers of Bk-EPG graphs and Bk-VPG graphs for each non-negative integer k. Finally, we show that every Chordal B1-EPG graph is at the intersection of VPT and EPT.