Results 11 to 20 of about 1,324,556 (299)
Graph products of groups [PDF]
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 more sources
A note on the convexity number for complementary prisms [PDF]
In the geodetic convexity, a set of vertices $S$ of a graph $G$ is $\textit{convex}$ if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The cardinality $con(G)$ of a maximum proper convex set $S$ of $G$ is the $\textit{
Diane Castonguay +3 more
doaj +1 more source
Triple Connected Domination Number of a Graph [PDF]
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Inferring Complementary and Substitutable Products Based on Knowledge Graph Reasoning
Complementarity and substitutability between products are essential concepts in retail and marketing. To achieve this, existing approaches take advantage of knowledge graphs to learn more evidence for inference.
Yan Fang +3 more
doaj +1 more source
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph [PDF]
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see ...
Yingzhi Tian, Huaping Ma, Liyun Wu
openaire +4 more sources
Generalized pairwise z-complementary codes [PDF]
An approach to generate generalized pairwise Z-complementary (GPZ) codes, which works in pairs in order to offer a zero correlation zone (ZCZ) in the vicinity of zero phase shift and fit extremely well in power efficient quadrature carrier modems, is ...
Loo, KK, Fan, P, Tung, X, Feng, L
core +6 more sources
A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Certain Concepts in m-Polar Fuzzy Graph Structures
We apply the concept of m-polar fuzzy sets to graph structures. We introduce certain concepts in m-polar fuzzy graph structures, including strong m-polar fuzzy graph structure, m-polar fuzzy Di-cycle, m-polar fuzzy Di-tree, m-polar fuzzy Di-cut vertex ...
Muhammad Akram +2 more
doaj +1 more source
Hadwiger Numbers of Self-complementary Graphs [PDF]
6 pages, 4 figures, 1 ...
Andrei Pavelescu, Elena Pavelescu
openaire +4 more sources

