Results 41 to 50 of about 137,342 (261)
The clique number of the intersection graph of a cyclic group of order with at most three prime factors [PDF]
ریاضی و جامعه, 2023 Let $G$ be a finite non-trivial group. The intersection graph $\Gamma(G)$, is a graph whose vertices are all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H $ and $K$ if and only if $H\cap K\neq 1$.
Seyyed Majid Jafarian Amiri +1 more
doaj +1 more source
Exploring Relationship Between Traditional Lattices and Graph Lattices of Topological Coding
Jisuanji kexue yu tansuo, 2021 It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored graphic
ZHANG Mingjun, YANG Sihua, YAO Bing
doaj +1 more source
Frontiers in Physics, 2023 The Transmission Control Protocol usually involves incomplete and imperfect network states for which sophisticated analysis is needed. Fuzzy logic could be more helpful for the analysis of network state more accurately.
Xiaolong Shi +2 more
doaj +1 more source
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles [PDF]
Theoretical Computer Science, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu, Qiaojun +5 more
openaire +4 more sources
Random subcube intersection graphs I: cliques and covering [PDF]
, 2015 We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is ...
Falgas-Ravry, Victor, Markström, Klas
core +1 more source
A Superclass of Edge-Path-Tree graphs with few cliques [PDF]
, 2009 Edge-Path-Tree graphs are intersection graphs of Edge-Path-Tree matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. Edge-Path-Tree graphs have polynomially many cliques as proved in [4] and [7]. Therefore,
Apollonio, Nicola, Caramia, Massimiliano
core +1 more source
Using Video Analytics to Improve Traffic Intersection Safety and Performance
Vehicles, 2022 Road safety has always been a crucial priority for municipalities, as vehicle accidents claim lives every day. Recent rapid improvements in video collection and processing technologies enable traffic researchers to identify and alleviate potentially ...
Ahan Mishra +5 more
doaj +1 more source
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources
Old and new generalizations of line graphs
International Journal of Mathematics and Mathematical Sciences, 2004 Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source