scholarly journals Even Cycles and Even 2-Factors in the Line Graph of a Simple Graph

10.37236/5660 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Arrigo Bonisoli ◽  
Simona Bonvicini
Keyword(s):  
Perfect Matching ◽  
Line Graph ◽  
Simple Graph ◽  
Connected Components ◽  
Regular Graphs ◽  
Necessary And Sufficient Condition ◽  
Cubic Graph ◽  
Cycle Decomposition ◽  
Odd Degree ◽  
Necessary And Sufficient

Let $G$ be a connected graph with an even number of edges. We show that if the subgraph of $G$ induced by the vertices of odd degree has a perfect matching, then the line graph of $G$ has a $2$-factor whose connected components are cycles of even length (an even $2$-factor). For a cubic graph $G$, we also give a necessary and sufficient condition so that the corresponding line graph $L(G)$ has an even cycle decomposition of index $3$, i.e., the edge-set of $L(G)$ can be partitioned into three $2$-regular subgraphs whose connected components are cycles of even length. The more general problem of the existence of even cycle decompositions of index $m$ in $2d$-regular graphs is also addressed.

scholarly journals Some Properties of Regular Line Graphs

2008 ◽  
pp. 44-49
Keyword(s):  
Key Words ◽  
Bipartite Graph ◽  
Line Graph ◽  
Bipartite Graphs ◽  
Line Graphs ◽  
Sufficient Condition ◽  
Regular Graphs ◽  
Necessary And Sufficient Condition ◽  
Regular Line ◽  
Necessary And Sufficient

In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied. Further, the necessary and sufficient condition for regular line graph to be bipartite graph have also been proved. Key words: Line Graphs, Regular graphs, Connected graphs, Bipartite Graphs.

Unitary homogeneous bi-Cayley graphs over finite commutative rings

2019 ◽  
Vol 19 (09) ◽  
pp. 2050173
Author(s):  
Xiaogang Liu ◽  
Chengxin Yan
Keyword(s):  
Commutative Ring ◽  
Cayley Graph ◽  
Line Graph ◽  
Cayley Graphs ◽  
Commutative Rings ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient ◽  
Finite Commutative Rings

Let [Formula: see text] denote the unitary homogeneous bi-Cayley graph over a finite commutative ring [Formula: see text]. In this paper, we determine the energy of [Formula: see text] and that of its complement and line graph, and characterize when such graphs are hyperenergetic. We also give a necessary and sufficient condition for [Formula: see text] (respectively, the complement of [Formula: see text], the line graph of [Formula: see text]) to be Ramanujan.

scholarly journals Sufficient conditions for matchings

1972 ◽  
Vol 18 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Ian Anderson
Keyword(s):  
Simple Proof ◽  
Perfect Matching ◽  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Number Of Components ◽  
Image Position ◽  
Necessary And Sufficient

A graph G is said to possess a perfect matching if there is a subgraph of G consisting of disjoint edges which together cover all the vertices of G. Clearly G must then have an even number of vertices. A necessary and sufficient condition for G to possess a perfect matching was obtained by Tutte (3). If S is any set of vertices of G, let p(S) denote the number of components of the graph G – S with an odd number of vertices. Then the conditionis both necessary and sufficient for the existence of a perfect matching. A simple proof of this result is given in (1).

Decompositions of some regular graphs into unicyclic graphs of order five

2019 ◽  
Vol 11 (04) ◽  
pp. 1950042 ◽  
Author(s):  
P. Paulraja ◽  
T. Sivakaran
Keyword(s):  
Necessary Conditions ◽  
Discrete Math ◽  
Complete Graphs ◽  
Regular Graphs ◽  
Necessary And Sufficient Condition ◽  
Unicyclic Graphs ◽  
Multipartite Graphs ◽  
Complete Multipartite ◽  
Necessary And Sufficient ◽  
Product Of Graphs

For a graph [Formula: see text] and a subgraph [Formula: see text] of [Formula: see text] an [Formula: see text]-decomposition of [Formula: see text] is a partition of the edge set of [Formula: see text] into subsets [Formula: see text] [Formula: see text] such that each [Formula: see text] induces a graph isomorphic to [Formula: see text] It is proved that the necessary conditions are sufficient for the existence of an [Formula: see text]-decomposition of the graph [Formula: see text] where [Formula: see text] is any simple connected unicyclic graph of order five, × denotes the tensor product of graphs and [Formula: see text] denotes the multiplicity of the edges. In fact, using the above characterization, a necessary and sufficient condition for the graph [Formula: see text] [Formula: see text] and [Formula: see text] to admit an [Formula: see text]-decomposition is obtained. Similar results for the complete graphs and complete multipartite graphs are proved in: [J.-C. Bermond et al. [Formula: see text]-decomposition of [Formula: see text], where [Formula: see text] has four vertices or less, Discrete Math. 19 (1977) 113–120, J.-C. Bermond et al. Decomposition of complete graphs into isomorphic subgraphs with five verices, Ars Combin. 10 (1980) 211–254, M. H. Huang, Decomposing complete equipartite graphs into connected unicyclic graphs of size five, Util. Math. 97 (2015) 109–117].

scholarly journals Families of Integral Cographs within a Triangular Array

2020 ◽  
Vol 8 (1) ◽  
pp. 257-273
Author(s):  
Hsin-Yun Ching ◽  
Rigoberto Flórez ◽  
Antara Mukherjee
Keyword(s):  
Triangular Array ◽  
Sufficient Condition ◽  
Complete Graphs ◽  
Regular Graphs ◽  
Necessary And Sufficient Condition ◽  
Empty Graph ◽  
Complete Product ◽  
Necessary And Sufficient

AbstractThe determinant Hosoya triangle, is a triangular array where the entries are the determinants of two-by-two Fibonacci matrices. The determinant Hosoya triangle mod 2 gives rise to three infinite families of graphs, that are formed by complete product (join) of (the union of) two complete graphs with an empty graph. We give a necessary and sufficient condition for a graph from these families to be integral.Some features of these graphs are: they are integral cographs, all graphs have at most five distinct eigenvalues, all graphs are either d-regular graphs with d =2, 4, 6, . . . or almost-regular graphs, and some of them are Laplacian integral. Finally we extend some of these results to the Hosoya triangle.

scholarly journals The competition number of a generalized line graph is at most two

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Boram Park ◽  
Yoshio Sano
Keyword(s):  
Graph Theory ◽  
Necessary Conditions ◽  
Line Graph ◽  
Sufficient Conditions ◽  
Line Graphs ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
International Audience ◽  
Necessary And Sufficient ◽  
Competition Number

Graph Theory International audience In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this paper, we generalize this result to the competition numbers of generalized line graphs, that is, we show that the competition number of a generalized line graph is at most two, and give necessary conditions and sufficient conditions for the competition number of a generalized line graph being one.

scholarly journals Power of 2 Decomposition of a Complete Tripartite Graph K2,4,M and a Special Butterfly Graph

2020 ◽  
Vol 9 (3) ◽  
pp. 3973-3976
Keyword(s):  
Simple Graph ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Edge Disjoint ◽  
Tripartite Graph ◽  
Necessary And Sufficient ◽  
Complete Tripartite Graph

Let G be a finite, connected simple graph with p vertices and q edges. If G1 , G2 ,…, Gn are connected edge-disjoint subgraphs of G with E(G) = E(G1 )  E(G2 )  …  E(Gn) , then {G1 , G2 , …, Gn} is said to be a decomposition of G. A graph G is said to have Power of 2 Decomposition if G can be decomposed into edge-disjoint subgraphs G G G n  2 4 2 , ,..., such that each G i 2 is connected and ( ) 2 , i E Gi  for 1  i  n. Clearly, 2[2 1] n q . In this paper, we investigate the necessary and sufficient condition for a complete tripartite graph K2,4,m and a Special Butterfly graph           3 2 5 BF 2m 1 to accept Power of 2 Decomposition.

scholarly journals On Vertex Covering Transversal Domination Number of Regular Graphs

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
R. Vasanthi ◽  
K. Subramanian
Keyword(s):  
Upper Bound ◽  
Domination Number ◽  
Simple Graph ◽  
Regular Graphs ◽  
Dominating Sets ◽  
Cubic Graph ◽  
Minimum Cardinality ◽  
Vertex Covering

A simple graphG=(V,E)is said to ber-regular if each vertex ofGis of degreer. The vertex covering transversal domination numberγvct(G)is the minimum cardinality among all vertex covering transversal dominating sets ofG. In this paper, we analyse this parameter on different kinds of regular graphs especially forQnandH3,n. Also we provide an upper bound forγvctof a connected cubic graph of ordern≥8. Then we try to provide a more stronger relationship betweenγandγvct.

scholarly journals Spectral Properties of Unitary Cayley Graphs of Finite Commutative Rings

10.37236/2390 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Xiaogang Liu ◽  
Sanming Zhou
Keyword(s):  
Spectral Properties ◽  
Line Graph ◽  
Commutative Rings ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Absolute Value ◽  
Vertex Set ◽  
Finite Commutative Ring ◽  
Unitary Cayley Graph ◽  
Necessary And Sufficient

Let $R$ be a finite commutative ring. The unitary Cayley graph of $R$, denoted $G_R$, is the graph with vertex set $R$ and edge set $\left\{\{a,b\}:a,b\in R, a-b\in R^\times\right\}$, where $R^\times$ is the set of units of $R$. An $r$-regular graph is Ramanujan if the absolute value of every eigenvalue of it other than $\pm r$ is at most $2\sqrt{r-1}$. In this paper we give a necessary and sufficient condition for $G_R$ to be Ramanujan, and a necessary and sufficient condition for the complement of $G_R$ to be Ramanujan. We also determine the energy of the line graph of $G_R$, and compute the spectral moments of $G_R$ and its line graph.

scholarly journals Dynamics of Boundary Graphs

2013 ◽  
Vol 5 (3) ◽  
pp. 447-455
Author(s):  
G. Mariumuthu ◽  
M. S. Saraswathy
Keyword(s):  
Simple Graph ◽  
The Other ◽  
Boundary Vertex ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Periodic Graph ◽  
Vertex Set ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Boundary Graph

In a graph G, the distance d(u,v) between a pair of vertices u and v is the length of a shortest path joining them. A vertex v is a boundary vertex of a vertex u if for all The boundary graph B(G) based on a connected graph G is a simple graph which has the vertex set as in G. Two vertices u and v are adjacent in B(G) if either u is a boundary of v or v is a boundary of u. If G is disconnected, then each vertex in a component is adjacent to all other vertices in the other components and is adjacent to all of its boundary vertices within the component. Given a positive integer m, the mth iterated boundary graph of G is defined as A graph G is periodic if for some m. A graph G is said to be an eventually periodic graph if there exist positive integers m and k >0 such that We give the necessary and sufficient condition for a graph to be eventually periodic.  Keywords: Boundary graph; Periodic graph. © 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. doi: http://dx.doi.org/10.3329/jsr.v5i3.14866 J. Sci. Res. 5 (3), xxx-xxx (2013) 

Sign in / Sign up

Export Citation Format

Share Document