scholarly journals Systems with the integer rounding property in normal monomial subrings

2010 ◽  
Vol 82 (4) ◽  
pp. 801-811 ◽  
Author(s):  
Luis A. Dupont ◽  
Carlos Rentería-Márquez ◽  
Rafael H. Villarreal
Keyword(s):  
Graph Theory ◽  
Linear System ◽  
Bipartite Graph ◽  
Connected Graph ◽  
Incidence Matrix ◽  
Edge Ideal ◽  
Rees Algebra ◽  
Canonical Module ◽  
Rees Algebras ◽  
Integer Rounding

Let C be a clutter and let A be its incidence matrix. If the linear system x > 0; x A < 1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the clutter is a connected graph, we describe when the aforementioned linear system has the integer rounding property in combinatorial and algebraic terms using graph theory and the theory of Rees algebras. As a consequence we show that the extended Rees algebra of the edge ideal of a bipartite graph is Gorenstein if and only if the graph is unmixed.

scholarly journals Multiplicative Zagreb indices of cacti

2016 ◽  
Vol 08 (03) ◽  
pp. 1650040 ◽  
Author(s):  
Shaohui Wang ◽  
Bing Wei
Keyword(s):  
Graph Theory ◽  
Lower Bounds ◽  
Connected Graph ◽  
Upper And Lower Bounds ◽  
Extremal Graphs ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Material Chemistry ◽  
Cactus Graph ◽  
Cactus Graphs

Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs.

scholarly journals Pelabelan 0-Anti Ajaib dan 2-Anti Ajaib untuk Graf Tangga L

2016 ◽  
Vol 12 (1) ◽  
pp. 63
Author(s):  
Quinoza Guvil ◽  
Roni Tri Putra
Keyword(s):  
Bipartite Graph ◽  
Connected Graph ◽  
Partition Dimension ◽  
Dimension Partition

For a connected graph  and a subset  of   . For a vertex  the distance betwen  and  is . For an ordered k-partition of ,  the representation of   with respect to  is    The k-partition  is a resolving partition if  are distinct for every  The minimum k for which there is a resolving partition of   is the partition dimension of   In this paper will shown resolving partition of  connected graph order  where  is a bipartite graph. Then it is shown dimension partition of bipartite graph, are pd(Kst)=n-1

Structural Analysis and Mobility Test of Fourteen Links Kinematic Chain Using Graph Theory

2014 ◽  
Vol 592-594 ◽  
pp. 1165-1169
Author(s):  
Preeti Gulia ◽  
V.P. Singh
Keyword(s):  
Graph Theory ◽  
Structural Analysis ◽  
Incidence Matrix ◽  
Reliable Method ◽  
Kinematic Chain ◽  
Polynomial Equation ◽  
Degree Of Freedom ◽  
Mobility Test ◽  
Structural Problems ◽  
Algebraic Test

The present work is focused on the graph theory which is used for structural analysis of kinematic chain and identification of degree of freedom. A method based on graph theory is proposed in this paper to solve structural problems by using a suitable example of fourteen links kinematic chain. Purpose of this paper is to give an easy and reliable method for structural analysis of fourteen links kinematic chain. Here, a simple incidence matrix is used to represent the kinematic chain. The proposed method is applied for determining the characteristic polynomial equation of fourteen links kinematic chain. An algebraic test based on graph theory is also used for identifying degree of freedom of kinematic chain whether it is total, partial or fractionated degree of freedom.

Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph

2019 ◽  
Vol 11 (06) ◽  
pp. 1950068
Author(s):  
Nopparat Pleanmani
Keyword(s):  
Bipartite Graph ◽  
Network Optimization ◽  
Connected Graph ◽  
Complete Bipartite Graph ◽  
Fixed Number ◽  
Arbitrary Vertex ◽  
Graph Pebbling ◽  
Vertex Set ◽  
Graham’S Conjecture ◽  
Pebbling Number

A graph pebbling is a network optimization model for the transmission of consumable resources. A pebbling move on a connected graph [Formula: see text] is the process of removing two pebbles from a vertex and placing one of them on an adjacent vertex after configuration of a fixed number of pebbles on the vertex set of [Formula: see text]. The pebbling number of [Formula: see text], denoted by [Formula: see text], is defined to be the least number of pebbles to guarantee that for any configuration of pebbles on [Formula: see text] and arbitrary vertex [Formula: see text], there is a sequence of pebbling movement that places at least one pebble on [Formula: see text]. For connected graphs [Formula: see text] and [Formula: see text], Graham’s conjecture asserted that [Formula: see text]. In this paper, we show that such conjecture holds when [Formula: see text] is a complete bipartite graph with sufficiently large order in terms of [Formula: see text] and the order of [Formula: see text].

Binomial incidence matrix of a semigraph

2020 ◽  
pp. 2150017
Author(s):  
Jyoti Shetty ◽  
G. Sudhakara
Keyword(s):  
Graph Theory ◽  
Complete Graph ◽  
Adjacency Matrix ◽  
Incidence Matrix ◽  
Systematic Approach ◽  
Line Graph ◽  
The Matrix ◽  
Theory Of Graphs

A semigraph, defined as a generalization of graph by  Sampathkumar, allows an edge to have more than two vertices. The idea of multiple vertices on edges gives rise to multiplicity in every concept in the theory of graphs when generalized to semigraphs. In this paper, we define a representing matrix of a semigraph [Formula: see text] and call it binomial incidence matrix of the semigraph [Formula: see text]. This matrix, which becomes the well-known incidence matrix when the semigraph is a graph, represents the semigraph uniquely, up to isomorphism. We characterize this matrix and derive some results on the rank of the matrix. We also show that a matrix derived from the binomial incidence matrix satisfies a result in graph theory which relates incidence matrix of a graph and adjacency matrix of its line graph. We extend the concept of “twin vertices” in the theory of graphs to semigraph theory, and characterize them. Finally, we derive a systematic approach to show that the binomial incidence matrix of any semigraph on [Formula: see text] vertices can be obtained from the incidence matrix of the complete graph [Formula: see text].

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.

THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS

2013 ◽  
Vol 24 (06) ◽  
pp. 921-939 ◽  
Author(s):  
JING LI ◽  
DI LIU ◽  
JUN YUAN
Keyword(s):  
Bipartite Graph ◽  
Connected Graph ◽  
Disjoint Paths ◽  
Two Dimensional ◽  
Dimensional Torus

A k-container of a graph G is a set of k internally disjoint paths between two distinct vertices. A k-container of G is a k*-container if it contains all vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices, and a bipartite graph G is k*-laceable if there exists a k*-container between any two vertices from different partite sets of G. A k-connected graph (respectively, bipartite graph) G is super spanning connected (respectively, laceable) if G is r*-connected (r*-laceable) for any r with 1 ≤ r ≤ k. This paper shows that the two-dimensional torus Torus (m, n), m, n ≥ 3, is super spanning connected if at least one of m and n is odd and super spanning laceable if both m and n are even. Furthermore, the super spanning connectivity and spanning laceability of tori with faulty elements have been discussed.

scholarly journals The Partition Dimension of a Path Graph

2021 ◽  
Vol 13 (2) ◽  
pp. 66
Author(s):  
Vivi Ramdhani ◽  
Fathur Rahmi
Keyword(s):  
Graph Theory ◽  
Connected Graph ◽  
Ordered Set ◽  
Minimum Cardinality ◽  
Path Graph ◽  
Partition Dimension

Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph  and  is a subset of  writen . Suppose there is , then the distance between and  is denoted in the form . There is an ordered set of -partitions of, writen then  the representation of with respect tois the  The set of partitions ofis called a resolving partition if the representation of each  to  is different. The minimum cardinality of the solving-partition to  is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitions of path graph,  with ,  and  are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely pd (Pn)=2Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph  and  is a subset of  writen . Suppose there is , then the distance between and  is denoted in the form . There is an ordered set of -partitions of, writen then  the representation of with respect tois the  The set of partitions ofis called a resolving partition if the representation of each  to  is different. The minimum cardinality of the solving-partition to  is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitionsof path graph, with ,  and  are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely.

scholarly journals On the Edge Metric Dimension of Certain Polyphenyl Chains

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Muhammad Ahsan ◽  
Zohaib Zahid ◽  
Dalal Alrowaili ◽  
Aiyared Iampan ◽  
Imran Siddique ◽  
...  
Keyword(s):  
Graph Theory ◽  
Connected Graph ◽  
Metric Dimension ◽  
Chain Graph ◽  
Minimum Number ◽  
Valence Bonds

The most productive application of graph theory in chemistry is the representation of molecules by the graphs, where vertices and edges of graphs are the atoms and valence bonds between a pair of atoms, respectively. For a vertex w and an edge f = c 1 c 2 of a connected graph G , the minimum number from distances of w with c 1 and c 2 is called the distance between w and f . If for every two distinct edges f 1 , f 2 ∈ E G , there always exists w 1 ∈ W E ⊆ V G such that d f 1 , w 1 ≠ d f 2 , w 1 , then W E is named as an edge metric generator. The minimum number of vertices in W E is known as the edge metric dimension of G . In this paper, we calculate the edge metric dimension of ortho-polyphenyl chain graph O n , meta-polyphenyl chain graph M n , and the linear [n]-tetracene graph T n and also find the edge metric dimension of para-polyphenyl chain graph L n . It has been proved that the edge metric dimension of O n , M n , and T n is bounded, while L n is unbounded.

scholarly journals Erdos – Renyi Random Graph and Machine Learning Based Botnet Detection

2020 ◽  
Vol 9 (5) ◽  
pp. 1037-1040
Keyword(s):  
Machine Learning ◽  
Probability Theory ◽  
Graph Theory ◽  
Complex Network ◽  
Random Graphs ◽  
Connected Graph ◽  
Free Graph ◽  
Botnet Detection ◽  
Scale Free ◽  
Made In

Basically large networks are prone to attacks by bots and lead to complexity. When the complexity occurs then it is difficult to overcome the vulnerability in the network connections. In such a case, the complex network could be dealt with the help of probability theory and graph theory concepts like Erdos – Renyi random graphs, Scale free graph, highly connected graph sequences and so on. In this paper, Botnet detection using Erdos – Renyi random graphs whose patterns are recognized as the number of connections that the vertices and edges made in the network is proposed. This paper also presents the botnet detection concepts based on machine learning.

Sign in / Sign up

Export Citation Format

Share Document