FUZZY INTERSECTION GRAPHS OF FUZZY SEMIGROUPS

2006 ◽  
Vol 02 (01) ◽  
pp. 1-10
Author(s):  
M. K. SEN ◽  
G. CHOWDHURY ◽  
D. S. MALIK
Keyword(s):  
Intersection Graph ◽  
Common Multiple ◽  
Intersection Graphs

Let S be a semigroup. This paper studies the intersection graphs of fuzzy semigroups. It is shown that the fuzzy intersection graph Int(G(S)), of S, is complete if and only if S is power joined. If Γ(S) denotes the set of all fuzzy right ideals of S, then the fuzzy intersection graph Int(Γ(S)) is complete if and only if S is fuzzy right uniform. Moreover, it is shown that Int(Γ(S)) is chordal if and only if for a,b,c,d ∈ S, some pair from {a,b,c,d} has a right common multiple property. It is also shown that if Int(G(S)) is complete and S has the acc on subsemigroups, then S is cyclic.

scholarly journals Turán-type results for intersection graphs of boxes

2021 ◽  
pp. 1-6
Author(s):  
István Tomon ◽  
Dmitriy Zakharov
Keyword(s):  
Short Note ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Poset Dimension ◽  
Axis Parallel ◽  
Turán Theorem ◽  
Separation Dimension

Abstract In this short note, we prove the following analog of the Kővári–Sós–Turán theorem for intersection graphs of boxes. If G is the intersection graph of n axis-parallel boxes in $${{\mathbb{R}}^d}$$ such that G contains no copy of K t,t , then G has at most ctn( log n)2d+3 edges, where c = c(d)>0 only depends on d. Our proof is based on exploring connections between boxicity, separation dimension and poset dimension. Using this approach, we also show that a construction of Basit, Chernikov, Starchenko, Tao and Tran of K2,2-free incidence graphs of points and rectangles in the plane can be used to disprove a conjecture of Alon, Basavaraju, Chandran, Mathew and Rajendraprasad. We show that there exist graphs of separation dimension 4 having superlinear number of edges.

scholarly journals On the Isolated Vertices and Connectivity in Random Intersection Graphs

2011 ◽  
Vol 2011 ◽  
pp. 1-9 ◽  
Author(s):  
Yilun Shang
Keyword(s):  
Random Graphs ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Random Intersection Graph ◽  
Probability Of Connectivity ◽  
Asymptotic Probability

We study isolated vertices and connectivity in the random intersection graph . A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity. When and , we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well known in Erdős-Rényi random graphs.

scholarly journals Matchings, Cycle Bases, and the Maximum Genus of a Graph

10.37236/2479 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Michal Kotrbčík ◽  
Martin Škoviera
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Perfect Matching ◽  
Intersection Graph ◽  
Matching Number ◽  
Maximum Genus ◽  
Cycle Space ◽  
Intersection Graphs ◽  
Connected Graphs ◽  
Cycle Bases

We study the interplay between the maximum genus of a graph and bases of its cycle space via the corresponding intersection graph. Our main results show that the matching number of the intersection graph is independent of the basis precisely when the graph is upper-embeddable, and completely describe the range of matching numbers when the graph is not upper-embeddable. Particular attention is paid to cycle bases consisting of fundamental cycles with respect to a given spanning tree. For $4$-edge-connected graphs, the intersection graph with respect to any spanning tree (and, in fact, with respect to any basis) has either a perfect matching or a matching missing exactly one vertex. We show that if a graph is not $4$-edge-connected, different spanning trees may lead to intersection graphs with different matching numbers. We also show that there exist $2$-edge connected graphs for which the set of values of matching numbers of their intersection graphs contains arbitrarily large gaps.

scholarly journals Component Evolution in Random Intersection Graphs

10.37236/935 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Michael Behrisch
Keyword(s):  
Real World ◽  
Linear Order ◽  
Graph Model ◽  
Vertex Degree ◽  
Intersection Graph ◽  
Giant Component ◽  
Logarithmic Order ◽  
Intersection Graphs ◽  
Similarity Network ◽  
Random Intersection Graph

We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real–world networks. We show that for appropriate choice of the parameters random intersection graphs differ from $G_{n,p}$ in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor is the second largest of logarithmic order. We also describe a test of our result on a protein similarity network.

scholarly journals On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane

10.37236/1805 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Seog-Jin Kim ◽  
Alexandr Kostochka ◽  
Kittikorn Nakprasit
Keyword(s):  
Chromatic Number ◽  
Convex Sets ◽  
Convex Set ◽  
Clique Number ◽  
Finite Family ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Homothetic Copies

Let $G$ be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number $k$ is $(3k-3)$-degenerate. This bound is sharp. As a consequence, we derive that $G$ is $(3k-2)$-colorable. We show also that the chromatic number of every intersection graph $H$ of a family of homothetic copies of a fixed convex set in the plane with clique number $k$ is at most $6k-6$.

The intersection graph of a group

2015 ◽  
Vol 14 (05) ◽  
pp. 1550065 ◽  
Author(s):  
S. Akbari ◽  
F. Heydari ◽  
M. Maghasedi
Keyword(s):  
Disjoint Union ◽  
Abelian Groups ◽  
Solvable Groups ◽  
Intersection Graph ◽  
Free Graph ◽  
Intersection Graphs ◽  
Cyclic Groups ◽  
Vertex Set

Let G be a group. The intersection graph of G, denoted by Γ(G), is the graph whose vertex set is the set of all nontrivial proper subgroups of G and two distinct vertices H and K are adjacent if and only if H ∩ K ≠ 1. In this paper, we show that the girth of Γ(G) is contained in the set {3, ∞}. We characterize all solvable groups whose intersection graphs are triangle-free. Moreover, we show that if G is finite and Γ(G) is triangle-free, then G is solvable. Also, we prove that if Γ(G) is a triangle-free graph, then it is a disjoint union of some stars. Among other results, we classify all abelian groups whose intersection graphs are complete. Finally, we study the intersection graphs of cyclic groups.

ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET

2017 ◽  
Vol 97 (2) ◽  
pp. 185-193 ◽  
Author(s):  
SARIKA DEVHARE ◽  
VINAYAK JOSHI ◽  
JOHN LAGRANGE
Keyword(s):  
Partially Ordered Set ◽  
Zero Divisor ◽  
Ordered Set ◽  
Clique Number ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Partially Ordered ◽  
Zero Divisor Graph

In this paper, it is proved that the complement of the zero-divisor graph of a partially ordered set is weakly perfect if it has finite clique number, completely answering the question raised by Joshi and Khiste [‘Complement of the zero divisor graph of a lattice’,Bull. Aust. Math. Soc. 89(2014), 177–190]. As a consequence, the intersection graph of an intersection-closed family of nonempty subsets of a set is weakly perfect if it has finite clique number. These results are applied to annihilating-ideal graphs and intersection graphs of submodules.

scholarly journals Biclique Covers and Partitions

10.37236/3595 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Trevor Pinto
Keyword(s):  
Analogous Result ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Partition Number ◽  
Additional Information ◽  
Open Questions ◽  
Dimensional Cube

The biclique cover number (resp. biclique partition number) of a graph $G$, $\mathrm{bc}(G$) (resp. $\mathrm{bp}(G)$), is the least number of bicliques - complete bipartite subgraphs - that are needed to cover (resp. partition) the edges of $G$.The local biclique cover number (resp. local biclique partition number)  of a graph $G$, $\mathrm{lbc}(G$) (resp. $\mathrm{lbp}(G)$), is the least $r$ such that there is a cover (resp. partition) of the edges of $G$ by bicliques with no vertex in more than $r$ of these bicliques.We show that $\mathrm{bp}(G)$ may be bounded in terms of $\mathrm{bc}(G)$, in particular, $\mathrm{bp}(G)\leq \frac{1}{2}(3^\mathrm{bc(G)}-1)$. However, the analogous result does not hold for the local measures. Indeed, in our main result, we show that $\mathrm{lbp}(G)$ can be arbitrarily large, even for graphs with $\mathrm{lbc}(G)=2$. For such graphs, $G$, we try to bound $\mathrm{lbp}(G)$ in terms of additional information about biclique covers of $G$. We both answer and leave open questions related to this.There is a well known link between biclique covers and subcube intersection graphs. We consider the problem of finding the least $r(n)$ for which every graph on $n$ vertices can be represented as a subcube intersection graph in which every subcube has dimension $r$. We reduce this problem to the much studied question of finding the least $d(n)$ such that every graph on $n$ vertices is the intersection graph of subcubes of a $d$-dimensional cube.

scholarly journals Representations of Edge Intersection Graphs of Paths in a Tree

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Martin Charles Golumbic ◽  
Marina Lipshteyn ◽  
Michal Stern
Keyword(s):  
Analogous Result ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Network Applications ◽  
Host Trees ◽  
Complete Problems ◽  
Vertex Set ◽  
International Audience ◽  
Np Complete ◽  
Simple Paths

International audience Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an edge if the corresponding members of $\mathcal{P}$ share a common edge in $T$. An undirected graph $G$ is called an edge intersection graph of paths in a tree, if $G = EPT(\mathcal{P})$ for some $\mathcal{P}$ and $T$. The EPT graphs are useful in network applications. Scheduling undirected calls in a tree or assigning wavelengths to virtual connections in an optical tree network are equivalent to coloring its EPT graph. It is known that recognition and coloring of EPT graphs are NP-complete problems. However, the EPT graphs restricted to host trees of vertex degree 3 are precisely the chordal EPT graphs, and therefore can be colored in polynomial time complexity. We prove a new analogous result that weakly chordal EPT graphs are precisely the EPT graphs with host tree restricted to degree 4. This also implies that the coloring of the edge intersection graph of paths in a degree 4 tree is polynomial. We raise a number of intriguing conjectures regarding related families of graphs.

Intersection graphs of general linear groups

2020 ◽  
pp. 2150039
Author(s):  
Mai Hoang Bien ◽  
Do Hoang Viet
Keyword(s):  
Finite Field ◽  
Linear Group ◽  
General Linear Group ◽  
Undirected Graph ◽  
Intersection Graph ◽  
General Linear ◽  
Linear Groups ◽  
Intersection Graphs ◽  
General Linear Groups ◽  
Vertex Set

Let [Formula: see text] be a field and [Formula: see text] the general linear group of degree [Formula: see text] over [Formula: see text]. The intersection graph [Formula: see text] of [Formula: see text] is a simple undirected graph whose vertex set includes all nontrivial proper subgroups of [Formula: see text]. Two vertices [Formula: see text] and [Formula: see text] of [Formula: see text] are adjacent if [Formula: see text] and [Formula: see text]. In this paper, we show that if [Formula: see text] is a finite field containing at least three elements, then the diameter [Formula: see text] is [Formula: see text] or [Formula: see text]. We also classify [Formula: see text] according to [Formula: see text]. In case [Formula: see text] is infinite, we prove that [Formula: see text] is one-ended of diameter 2 and its unique end is thick.

Sign in / Sign up

Export Citation Format

Share Document