Neighborhood structures and products of undirected graphs
نویسندگان
چکیده
Let G = (V,E) be a simple undirected graph. The neighborhood hypergraph N (G) = (V, EN ) of G has the edge set EN = {e ⊆ V | |e| ≥ 1 ∧ ∃x ∈ V : e = NG(x)}. In a certain sense, this is a generalization of the well-known notion of the neighborhood graph N(G) = (V,EN ). For several products G1 ◦G2 of simple undirected graphs G1 and G2, we investigate the question how N(G1 ◦G2) / N (G1 ◦G2) can be constructed from G1, G2, N(G1), N(G2) / N (G1), N (G2) and vice versa.
منابع مشابه
NILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملSpectra of some new extended corona
For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...
متن کاملThe completeness number of neighborhood graphs
Let G = (V,E) be a simple undirected graph. N(G) = (V,EN ) is the neighborhood graph of G, if and only if EN = {{a, b} ∣ a ∕= b ∧ ∃x ∈ V : {x, a} ∈ E ∧ {x, b} ∈ E}. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite. We present some results concerning the k-iterated neighborhood graph Nk(G) := N(N(. . . N(G))) of G. So we det...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013