Fuzzy intersection graph: a geometrical approach

2021 ◽  
Author(s):  
Sreenanda Raut ◽  
Madhumangal Pal
Keyword(s):  
Intersection Graph ◽  
Geometrical Approach

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.

Studies on Isotropy of Planar 5-Bar Linkages

2004 ◽  
Author(s):  
C. Amarnath ◽  
K. N. Umesh
Keyword(s):  
Geometric Approach ◽  
Geometrical Approach ◽  
End Effector ◽  
Isotropic Point ◽  
Important Requirement ◽  
Point To Point

The ability to move at reasonable ease in all directions is an important requirement in the design of manipulators. The degree of ease of mobility varies from point to point in the workspace of the manipulator’s end effector. Maximum ease of mobility is obtained at an isotropic point, and the minimum occurs at singularities. An attempt has been made here to use a geometric approach for determining the isotropic points in the workspace of planar 5-bar linkages. The geometrical approach leads to interesting observations on the location of isotropic points in the workspace. The procedure also yields a technique for the synthesis of 5-bar linkages and associated coupler points exhibiting isotropic behaviour. Additionally it has been shown that coupler points exhibiting isotropic mobility occur in pairs.

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.

Integrating nutrition: a geometrical approach

1999 ◽  
Vol 91 (1) ◽  
pp. 67-82 ◽  
Author(s):  
D. Raubenheimer ◽  
S.J. Simpson
Keyword(s):  
Geometrical Approach
Sign in / Sign up

Export Citation Format

Share Document