• No results found

Intersection graph

A Character Based Intersection Graph Approach to Linguistic Phylogeny

A Character Based Intersection Graph Approach to Linguistic Phylogeny

... an intersection graph of a family of sets S if there is a bijection F between V and S such that for every two sets s, t ∈ S F (s) is adjacent to F(t) if and only if s intersects ...tion graph in ...

5

Co-intersection graph of submodules of a module

Co-intersection graph of submodules of a module

... co-intersection graph of proper submodules of M , denoted by Ω(M ), is an undirected simple graph whose the vertex set V (Ω) is a set of all non-trivial submodules of M and there is an edge between ...

16

Planarity of a spanning subgraph of the intersection graph of ideals of a commutative ring I, nonquasilocal case

Planarity of a spanning subgraph of the intersection graph of ideals of a commutative ring I, nonquasilocal case

... A b s t r ac t . The rings considered in this article are nonzero commutative with identity which are not fields. Let R be a ring. We denote the collection of all proper ideals of R by I (R) and the collection I ...

14

Some results on a subgraph of the intersection graph of ideals of a commutative ring

Some results on a subgraph of the intersection graph of ideals of a commutative ring

... the intersection graph of ideals of R, denoted by G(R), is an undirected graph whose vertex set is LI (R) ∗ and distinct vertices I 1 , I 2 are adjacent in G(R) if and ...

27

The small intersection graph relative to multiplication modules

The small intersection graph relative to multiplication modules

... small intersection graph G(M ) of M with all non-small proper submodules of M as vertices and two distinct vertices N, K are adjacent if and only if N ∩ K is a non-small sub- module of M ...the ...

12

Intersection graph of subgroups of some non-abelian groups

Intersection graph of subgroups of some non-abelian groups

... The intersection graph of subgroups of a group G is a graph whose vertex set is the set of all proper subgroups of G and two distinct vertices are adjacent if and only if their intersection is ...

5

k-Intersection Graph of a Finite Set

k-Intersection Graph of a Finite Set

... science such as economics, social system modeling, financial matters and so on. For example, consider n people who want to invest for some companies. These people consist of k foreigners and n − k natives. Each company ...

13

Planarity of Intersection Graph of submodules of a Module

Planarity of Intersection Graph of submodules of a Module

... the graph of subgroups of a finite group. The intersection graph of ideals of a ring, was considered by Chakrabarty, Ghosh, Mukherjee and Sen in ...the intersection graph of submodules ...

5

Planarity of a spanning subgraph of the intersection graph of ideals of a commutative ring II, Quasilocal Case

Planarity of a spanning subgraph of the intersection graph of ideals of a commutative ring II, Quasilocal Case

... a SPIR with m 9 = (0 + X 9 K[X]) but m 8 6= (0 + X 9 K[X]). Note that V (H(T )) = { n i |i ∈ {1, 2, . . . , k}} and V (H(R)) = { m j |j ∈ {1, 2, . . . , 8}} and the mapping f : V (H(T )) → V (H(R)) defined by f ( n i ) = ...

27

On a graph isomorphic to its intersection graph: self-graphoidal graphs

On a graph isomorphic to its intersection graph: self-graphoidal graphs

... unicyclic graph with unique pendant vertex v and a cut vertex ...the graph G, when G − v is obtained from a cycle by a Whitney-Robbins synthesis, is also not ...

9

Homotopical approach to quantum contextuality

Homotopical approach to quantum contextuality

... Many proofs of contextuality of quantum me- chanics employ fixed sets of observables to find obstructions to the existence of non-contextual value assignments. Two key examples are Mer- min’s square and star [28]. ...

20

Graph-theoretic  design   and  analysis  of  key  predistribution  schemes

Graph-theoretic design and analysis of key predistribution schemes

... key graph of a KPS in the way described in Section ...block intersection graph of a KPS, corresponding to the common terminology in combinatorial design ...incidence graph can have advantages ...

21

Independent sets in vertex arrival streams

Independent sets in vertex arrival streams

... a graph over the list of identifiers received. Geometric intersection graphs, received as a stream of geometric objects, are the most natural members of this ...interval intersection graph can ...

15

APPLICATIONS OF BIPOLAR FUZZY SETS IN INTERVAL GRAPHS

APPLICATIONS OF BIPOLAR FUZZY SETS IN INTERVAL GRAPHS

... fuzzy graph is a growing research topic as it is the gener- alization of fuzzy ...that intersection of two bipolar fuzzy intervals may not be a bipolar fuzzy ...the intersection graph of a ...

14

Characterizing compatibility and agreement of unrooted trees via cuts in graphs

Characterizing compatibility and agreement of unrooted trees via cuts in graphs

... display graph. Alternatively, it can be characterized as a chordal graph sandwich problem in a structure known as the edge label intersection ...

14

Epidemics on random intersection graphs

Epidemics on random intersection graphs

... random graph constructed via the configuration model [23],[16, Chapter ...random intersection graphs, intro- duced in [22] and further studied in ...Random intersection graphs may be seen as models ...

43

Tractable consideration set structures for assortment optimization and network revenue management

Tractable consideration set structures for assortment optimization and network revenue management

... Another application related to appointment scheduling is the work of Asdemir, Jacob, and Krishnan [1] who look at the question of how to dynamically price delivery time-slots for attended home delivery over a finite ...

22

Two New Results on Permutation Graphs

Two New Results on Permutation Graphs

... A graph G=(V,E) is called an intersection graph for a finite family F of a non empty set if there is a one to one correspondence between F and V such that two sets in F have non empty ...

7

AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}

AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}

... Abstract: Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with ...

6

Comparision of Some Operator Graphs

Comparision of Some Operator Graphs

... a graph and investigating algebraic properties of the group using graph theoretical ...a graph to a group or ring and thereby investigating algebraic properties of the group or ring using the ...

6

Show all 8126 documents...

Related subjects