Results 21 to 30 of about 2,938,351 (247)

The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle

open access: yesMathematics, 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

On the Crossing Numbers of Cartesian Products of Wheels and Trees

open access: yesDiscussiones 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

Parity Properties of Configurations

open access: yesMathematics, 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

DatabaseGroup/metric-join-datasets: v1.0.0

open access: yes, 2022
Contains the experimental data of the metric join ...
Thomas Hütter, Manuel Widmoser
core   +1 more source

On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six

open access: yesDiscussiones 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

Quadripartitioned Neutrosophic Graph Structures [PDF]

open access: yesNeutrosophic 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

Approximate Top-k Inner Product Join with a Proximity Graph [PDF]

open access: yes
Nakama H., Amagata D., Hara T.. Approximate Top-k Inner Product Join with a Proximity Graph. Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 , 4468 (2021); https://doi.org/10.1109/BigData52589.2021.9671858.This paper addresses
Amagata, Daichi   +2 more
core   +2 more sources

JOIN² and openCost

open access: yes, 2022
Founded more than 10 years ago, the JOIN² collaboration brings together eight research institutions for the development and operation of a full-fledged shared scholarly publication database and repository based on the Invenio open source framework for ...
Wagner, Alexander, JOIN² Collaboration
core   +1 more source

Data-driven through-life costing to support product lifecycle management solutions in innovative product development [PDF]

open access: yes, 2011
Innovative product usually refers to product that comprises of creativity and new ideas. In the development of such a new product, there is often a lack of historical knowledge and data available to be used to perform cost estimation accurately.
John D. Lanham   +9 more
core   +1 more source

Product Pre-Launch Prediction From Resilient Distributed e-WOM Data

open access: yesIEEE Access, 2020
Pre-launch success prediction of a product is a challenge in today's electronic world. Based on this prediction, industries can avoid huge losses by deciding on whether to launch or not to launch a product into the market.
Sandhya Narayanan   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy