Results 41 to 50 of about 6,290,196 (343)
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
Parity Properties of Configurations
Mathematics, 2022 In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting of two components isomorphic to K2 and K3 is given, where Dn consists of n isolated vertices.
Michal Staš
doaj +1 more source
The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
Mathematics, 2023 The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim
Zongpeng Ding, Xiaomei Qian
doaj +1 more source
Mathematical Problems in Engineering, 2021 The traditional distributed database storage architecture has the problems of low efficiency and storage capacity in managing data resources of seafood products. We reviewed various storage and retrieval technologies for the big data resources.
Yajun Wang +4 more
semanticscholar +1 more source
Quadripartitioned Neutrosophic Graph Structures [PDF]
Neutrosophic Sets and Systems, 2022 The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part.
S. Satham Hussain +5 more
doaj +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj +1 more source
On the power domination number of corona product and join graphs
Journal of Physics: Conference Series, 2019 A set D of vertices of graph G is called a dominating set if every vertex u∈V(G)−D is adjacent to some vertex υ∈D . A set D to be a power dominating set of a graph if every vertex and every edge in the system are monitored by the set D.
I. Yuliana +3 more
semanticscholar +1 more source
Certain operations on interval-valued picture fuzzy graphs with application
International Journal of Mathematics for Industry, 2023 Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
doaj +1 more source
Law School as a Consumer Product: Beat \u27em or Join \u27em [PDF]
, 2020 With rising costs, pressure on performance metrics, and competitive high-profile rankings, law schools are more than ever before being judged on a consumer satisfaction basis by both students and the public.
Vollweiler, Debra Moss
core +1 more source