Results 21 to 30 of about 855,414 (324)

Cyclic Permutations in Determining Crossing Numbers

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

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

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

open access: yesMathematics, 2021
The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
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

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

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

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

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

Join-irreducible cross product varieties of groups [PDF]

open access: yesTransactions of the American Mathematical Society, 1974
Let U, !8 be varieties of groups which have finite coprime exponents, let U be metabelian and nilpotent with "small" nilpotency class, and let !8 be abelian. The product variety U!8 is shown to be join-irreducible if and only if U is join-irreducible. This is done by obtaining a simple description for the critical groups generating U!8 when U is join ...
openaire   +2 more sources

Law School as a Consumer Product: Beat \u27em or Join \u27em [PDF]

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

Home - About - Disclaimer - Privacy