scholarly journals C-graphs - A Mixed Graphical Representation of Groups

2021 ◽  
Vol 20 ◽  
pp. 569-580
Author(s):  
Sinu N. Vijayan ◽  
Anjaly Kishore
Keyword(s):  
Structural Properties ◽  
Upper Bound ◽  
Graphical Representation ◽  
Group Structure ◽  
Mathematical Formula ◽  
Mixed Graph ◽  
Vertex Set ◽  
Order Of An Element ◽  
Clear Idea

Corresponding to each group Γ, a mixed graph G = (Γ,E,E′) called C-graph is assigned, such that the vertex set of G is the group itself. Two types of adjacency relations, that is, one way and two way communication is defined for vertices, to get a clear idea of the underlying group structure. An effort to answer the question, ‘Is there any relation between the order of an element in the group and degrees of the corresponding vertex in the C-graph’, by proposing a mathematical formula connecting them is made. Established an upper bound for the total number of edges in a C-graph G. For a vertex z in G, the concept Connector Edge CEz is defined, which convey some structural properties of the group Γ. The Connector Edge Set is defined for both a vertex z and the whole C-graph G, and is denoted as C E z and C E G respectively. Proposed the result, C E G = E if and only if |Γ| = 2n, n ∈ N. Finally, the properties of G, which the Connector Edge Set C E G carry out are discussed.

scholarly journals On connectedness of power graphs of finite groups

2018 ◽  
Vol 17 (10) ◽  
pp. 1850184 ◽  
Author(s):  
Ramesh Prasad Panda ◽  
K. V. Krishna
Keyword(s):  
Finite Groups ◽  
Upper Bound ◽  
The Other ◽  
Number Of Components ◽  
Cyclic Groups ◽  
Power Graph ◽  
Vertex Set ◽  
Proper Power

The power graph of a group [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of [Formula: see text]-groups are studied. In particular, the number of components of that of abelian [Formula: see text]-groups are determined.

scholarly journals The Unique Mixed Almost Moore Graph with Parameters k = 2, r = 2 and z = 1

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741005 ◽  
Author(s):  
DOMINIQUE BUSET ◽  
NACHO LÓPEZ ◽  
JOSEP M. MIRET
Keyword(s):  
Upper Bound ◽  
Mixed Graph ◽  
Moore Graph

A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected degree r, maximum directed out-degree z and diameter k is given by the mixed Moore bound. Graphs with order attaining the Moore bound are known as Moore graphs, and they are very rare. Besides, graphs with prescribed parameters and order one less than the corresponding Moore bound are known as almost Moore graphs. In this paper we prove that there is a unique mixed almost Moore graph of diameter k = 2 and parameters r = 2 and z = 1.

scholarly journals On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1778
Author(s):  
Fangyun Tao ◽  
Ting Jin ◽  
Yiyou Tu
Keyword(s):  
Upper Bound ◽  
Maximum Degree ◽  
Bipartite Graphs ◽  
Equitable Partition ◽  
Special Cases ◽  
Vertex Set ◽  
Complete Bipartite Graphs

An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be equitably partitioned into t′ induced forests for every t′≥t, where the maximum degree of each induced forest is at most k. In this paper, we provide a general upper bound for va2≡(Kn,n). Exact values are obtained in some special cases.

Implosive graphs: Square-free monomials on symbolic Rees algebras

2016 ◽  
Vol 16 (08) ◽  
pp. 1750145 ◽  
Author(s):  
A. Flores-Méndez ◽  
I. Gitler ◽  
E. Reyes
Keyword(s):  
Structural Properties ◽  
Monomial Ideal ◽  
Minimal System ◽  
Rees Algebra ◽  
Rees Algebras ◽  
Vertex Set ◽  
Minimal System Of Generators

Let [Formula: see text] be the edge monomial ideal of a graph [Formula: see text], whose vertex set is [Formula: see text]. [Formula: see text] is implosive if the symbolic Rees algebra [Formula: see text] of [Formula: see text] has a minimal system of generators [Formula: see text] where [Formula: see text] are square-free monomials. We give some structural properties of implosive graphs and we prove that they are closed under clique-sums and odd subdivisions. Furthermore, we prove that universally signable graphs are implosive. We show that odd holes, odd antiholes and some Truemper configurations (prisms, thetas and even wheels) are implosive. Moreover, we study excluded families of subgraphs for the class of implosive graphs. In particular, we characterize which Truemper configurations and extensions of odd holes and antiholes are minimal nonimplosive.

scholarly journals A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem

2021 ◽  
Author(s):  
Hua Jiang ◽  
Dongming Zhu ◽  
Zhichao Xie ◽  
Shaowen Yao ◽  
Zhang-Hua Fu
Keyword(s):  
Branch And Bound ◽  
Upper Bound ◽  
Undirected Graph ◽  
State Of The Art ◽  
Search Space ◽  
Exact Algorithms ◽  
Induced Subgraph ◽  
Massive Graphs ◽  
Vertex Set ◽  
Number Of Branches

Given an undirected graph, the Maximum k-plex Problem (MKP) is to find a largest induced subgraph in which each vertex has at most k−1 non-adjacent vertices. The problem arises in social network analysis and has found applications in many important areas employing graph-based data mining. Existing exact algorithms usually implement a branch-and-bound approach that requires a tight upper bound to reduce the search space. In this paper, we propose a new upper bound for MKP, which is a partitioning of the candidate vertex set with respect to the constructing solution. We implement a new branch-and-bound algorithm that employs the upper bound to reduce the number of branches. Experimental results show that the upper bound is very effective in reducing the search space. The new algorithm outperforms the state-of-the-art algorithms significantly on real-world massive graphs, DIMACS graphs and random graphs.

Tight Upper Bound of the 3-Total-Rainbow Index for 2-(Edge-)Connected Graphs

2021 ◽  
pp. 2142001
Author(s):  
Yingbin Ma ◽  
Wenhan Zhu
Keyword(s):  
Upper Bound ◽  
Connected Graph ◽  
Total Coloring ◽  
Colored Graph ◽  
Fixed Integer ◽  
Connected Graphs ◽  
Vertex Set ◽  
Rainbow Coloring

Let [Formula: see text] be an edge-colored graph with order [Formula: see text] and [Formula: see text] be a fixed integer satisfying [Formula: see text]. For a vertex set [Formula: see text] of at least two vertices, a tree containing the vertices of [Formula: see text] in [Formula: see text] is called an [Formula: see text]-tree. The [Formula: see text]-tree [Formula: see text] is a total-rainbow [Formula: see text]-tree if the elements of [Formula: see text], except for the vertex set [Formula: see text], have distinct colors. A total-colored graph [Formula: see text] is said to be total-rainbow [Formula: see text]-tree connected if for every set [Formula: see text] of [Formula: see text] vertices in [Formula: see text], there exists a total-rainbow [Formula: see text]-tree in [Formula: see text], while the total-coloring of [Formula: see text] is called a [Formula: see text]-total-rainbow coloring. The [Formula: see text]-total-rainbow index of a nontrivial connected graph [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed in a [Formula: see text]-total-rainbow coloring of [Formula: see text]. In this paper, we show a sharp upper bound for [Formula: see text], where [Formula: see text] is a 2-connected or 2-edge-connected graph.

Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs

2011 ◽  
Vol 20 (4) ◽  
pp. 519-527 ◽  
Author(s):  
SEBASTIAN M. CIOABĂ ◽  
ANDRÉ KÜNDGEN ◽  
CRAIG M. TIMMONS ◽  
VLADISLAV V. VYSOTSKY
Keyword(s):  
Upper Bound ◽  
Uniform Hypergraph ◽  
Probability Problem ◽  
Vertex Set

An r-cut of the complete r-uniform hypergraph Krn is obtained by partitioning its vertex set into r parts and taking all edges that meet every part in exactly one vertex. In other words it is the edge set of a spanning complete r-partite subhypergraph of Krn. An r-cut cover is a collection of r-cuts such that each edge of Krn is in at least one of the cuts. While in the graph case r = 2 any 2-cut cover on average covers each edge at least 2-o(1) times, when r is odd we exhibit an r-cut cover in which each edge is covered exactly once. When r is even no such decomposition can exist, but we can bound the average number of times an edge is cut in an r-cut cover between $1+\frac1{r+1}$ and $1+\frac{1+o(1)}{\log r}$. The upper bound construction can be reformulated in terms of a natural polyhedral problem or as a probability problem, and we solve the latter asymptotically.

scholarly journals Simultaneous improvements of strength and toughness in topologically interlocked ceramics

2018 ◽  
Vol 115 (37) ◽  
pp. 9128-9133 ◽  
Author(s):  
Mohammad Mirkhalaf ◽  
Tao Zhou ◽  
Francois Barthelat
Keyword(s):  
3D Printing ◽  
3D Reconstruction ◽  
Structural Properties ◽  
Upper Bound ◽  
Building Blocks ◽  
Image Correlation ◽  
Multifunctional Materials ◽  
Architectured Materials ◽  
Strength And Toughness

Topologically interlocked materials (TIMs) are an emerging class of architectured materials based on stiff building blocks of well-controlled geometries which can slide, rotate, or interlock collectively providing a wealth of tunable mechanisms, precise structural properties, and functionalities. TIMs are typically 10 times more impact resistant than their monolithic form, but this improvement usually comes at the expense of strength. Here we used 3D printing and replica casting to explore 15 designs of architectured ceramic panels based on platonic shapes and their truncated versions. We tested the panels in quasi-static and impact conditions with stereoimaging, image correlation, and 3D reconstruction to monitor the displacements and rotations of individual blocks. We report a design based on octahedral blocks which is not only tougher (50×) but also stronger (1.2×) than monolithic plates of the same material. This result suggests that there is no upper bound for strength and toughness in TIMs, unveiling their tremendous potential as structural and multifunctional materials. Based on our experiments, we propose a nondimensional “interlocking parameter” which could guide the exploration of future architectured systems.

The Family of Lodato Proximities Compatible With a Given Topological Space

1974 ◽  
Vol 26 (02) ◽  
pp. 388-404 ◽  
Author(s):  
W. J. Thron ◽  
R. H. Warren
Keyword(s):  
Lower Bound ◽  
Topological Space ◽  
Distributive Lattice ◽  
Structural Properties ◽  
Upper Bound ◽  
Set Inclusion ◽  
The Family

Let (X, ) be a topological space. By we denote the family of all Lodato proximities on X which induce . We show that is a complete distributive lattice under set inclusion as ordering. Greatest lower bound and least upper bound are characterized. A number of techniques for constructing elements of are developed. By means of one of these constructions, all covers of any member of can be obtained. Several examples are given which relate to the lattice of all compatible proximities of Čech and the family of all compatible proximities of Efremovič. The paper concludes with a chart which summarizes many of the structural properties of , and .

Sign in / Sign up

Export Citation Format

Share Document