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

2021 ◽  
Vol 34 (4) ◽  
pp. 68-77
Author(s):  
Alaa J. Nawaf ◽  
Akram S. Mohammad
Keyword(s):  
Identity Element ◽  
Intersection Graph

         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.

scholarly journals Study on the Identification Method of Pyrogenetic Rock Based on N -DP Intersection Graph

2021 ◽  
Vol 804 (2) ◽  
pp. 022020
Author(s):  
Gang Hu ◽  
Zhiqiang Mao ◽  
Ping Yan ◽  
Qian Yin ◽  
Xiyu Wang ◽  
...  
Keyword(s):  
Intersection Graph ◽  
Identification Method

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 The intersection graph of a finite simple group has diameter at most 5

2021 ◽  
Author(s):  
Saul D. Freedman
Keyword(s):  
Simple Group ◽  
Upper Bound ◽  
Finite Simple Group ◽  
Unitary Groups ◽  
Intersection Graph ◽  
Monster Group ◽  
Prime Dimension

AbstractLet G be a non-abelian finite simple group. In addition, let $$\Delta _G$$ Δ G be the intersection graph of G, whose vertices are the proper non-trivial subgroups of G, with distinct subgroups joined by an edge if and only if they intersect non-trivially. We prove that the diameter of $$\Delta _G$$ Δ G has a tight upper bound of 5, thereby resolving a question posed by Shen (Czechoslov Math J 60(4):945–950, 2010). Furthermore, a diameter of 5 is achieved only by the baby monster group and certain unitary groups of odd prime dimension.

A Krasnosel’skii-type theorem for certain orthogonal polytopes starshaped via k-staircase paths

2020 ◽  
Vol 20 (2) ◽  
pp. 169-177 ◽  
Author(s):  
Marilyn Breen
Keyword(s):  
Type Theorem ◽  
Common Point ◽  
Finite Family ◽  
Intersection Graph ◽  
Axis Parallel ◽  
Orthogonal Polytopes

AbstractLet 𝒞 be a finite family of distinct axis-parallel boxes in ℝd whose intersection graph is a tree, and let S = ⋃{C : C in 𝒞}. If every two points of S see a common point of S via k-staircase paths, then S is starshaped via k-staircase paths. Moreover, the k-staircase kernel of S will be convex via k-staircases.

On the centres of hereditary JBW-subalgebras of a JBW-algebra

1979 ◽  
Vol 85 (2) ◽  
pp. 317-324 ◽  
Author(s):  
C. M. Edwards
Keyword(s):  
Banach Space ◽  
General Theory ◽  
Jordan Algebra ◽  
Identity Element ◽  
Image Position

A JB-algebra A is a real Jordan algebra, which is also a Banach space, the norm in which satisfies the conditions thatandfor all elements a and b in A. It follows from (1.1) and (l.2) thatfor all elements a and b in A. When the JB-algebra A possesses an identity element then A is said to be a unital JB-algebra and (1.2) is equivalent to the condition thatfor all elements a and b in A. For the general theory of JB-algebras the reader is referred to (2), (3), (7) and (10).

Preservation of elementary equivalence under scalar extension

1982 ◽  
Vol 47 (4) ◽  
pp. 734-738
Author(s):  
Bruce I. Rose
Keyword(s):  
Identity Element ◽  
Positive Answer ◽  
General Question ◽  
Division Algebras ◽  
Extension Field ◽  
Elementary Equivalence ◽  
Applied Model ◽  
Finite Dimensional ◽  
Positive Statements ◽  
Finite Dimensional Algebras

In this note we show that taking a scalar extension of two elementarily equivalent finite-dimensional algebras over the same field preserves elementary equivalence. The general question of whether or not tensor product preserves elementary equivalence was originally raised in [4]. In [3] Feferman relates an example of Ersov which answers the question negatively. Eklof and Olin [7] also provide a counterexample to the general question in the context of two-sorted structures. Thus the result proved below is a partial positive answer to a general question whose status has been resolved negatively. From the viewpoint of applied model theory it seems desirable to find contexts in which positive statements of preservation can be obtained. Our result does have an application; a corollary to it increases our understanding of what it means for two division algebras to be elementarily equivalent.All algebras are finite-dimensional algebras over fields. All algebras contain an identity element, but are not necessarily associative.Recall that the center of a not necessarily associative algebra A is the set of elements which commute and “associate” with all elements of A. The notion of a scalar extension is an important one in algebra. If A is an algebra over F and G is an extension field of F, then the scalar extension of A by G is the algebra A ⊗F G.

THE INTERSECTION GRAPH OF GAMMA SETS IN THE TOTAL GRAPH OF A COMMUTATIVE RING-II

2013 ◽  
Vol 12 (04) ◽  
pp. 1250199 ◽  
Author(s):  
T. ASIR ◽  
T. TAMIZH CHELVAM
Keyword(s):  
Commutative Ring ◽  
Independence Number ◽  
Clique Number ◽  
Commutative Rings ◽  
Intersection Graph ◽  
Vertex Connectivity ◽  
Total Graph ◽  
Graph Theoretic ◽  
Vertex Set ◽  
Finite Commutative Rings

The intersection graph ITΓ(R) of gamma sets in the total graph TΓ(R) of a commutative ring R, is the undirected graph with vertex set as the collection of all γ-sets in the total graph of R and two distinct vertices u and v are adjacent if and only if u ∩ v ≠ ∅. Tamizh Chelvam and Asir [The intersection graph of gamma sets in the total graph I, to appear in J. Algebra Appl.] studied about ITΓ(R) where R is a commutative Artin ring. In this paper, we continue our interest on ITΓ(R) and actually we study about Eulerian, Hamiltonian and pancyclic nature of ITΓ(R). Further, we focus on certain graph theoretic parameters of ITΓ(R) like the independence number, the clique number and the connectivity of ITΓ(R). Also, we obtain both vertex and edge chromatic numbers of ITΓ(R). In fact, it is proved that if R is a finite commutative ring, then χ(ITΓ(R)) = ω(ITΓ(R)). Having proved that ITΓ(R) is weakly perfect for all finite commutative rings, we further characterize all finite commutative rings for which ITΓ(R) is perfect. In this sequel, we characterize all commutative Artin rings for which ITΓ(R) is of class one (i.e. χ′(ITΓ(R)) = Δ(ITΓ(R))). Finally, it is proved that the vertex connectivity and edge connectivity of ITΓ(R) are equal to the degree of any vertex in ITΓ(R).

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.

Sign in / Sign up

Export Citation Format

Share Document