Skip to search formSkip to main contentSkip to account menu

Ladder graph

In the mathematical field of graph theory, the ladder graph Ln is a planar undirected graph with 2n vertices and n+2(n-1) edges. The ladder graph can… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Chromatic polynomialEdge-graceful labelingForbidden graph characterizationGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
ACYCLIC AND STAR COLORING OF DUPLICATE GRAPH OF LADDER GRAPH
I n this paper we present acyclic and star coloring algorithms to color the vertices of Duplicate graph of ladder L m .  Also we… 
2017
2017
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
2016
2016
On distance irregular labeling of ladder graph and triangular ladder graph
In this paper, we discussed graph labelings that the distance irregular labeling within which will be presented the results of… 
2016
2016
2-Dominator Coloring for Various Graphs in Graph Theory
: Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in… 
2014
2014
Some Cordial Labeling of Duplicate Graph of Ladder Graph
In this paper, we present that the duplicate graph of t e ladder graph , 2 is cordial, total cordial and prime cordial. 
2013
2013
Complexity of Some Graphs Generated by Ladder Graph
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can… 
2013
2013
On Mean Graphs
Throughout this paper, by a graph we mean a finite, undirected, simple graph. Let G(V,E) be a graph with p vertices and q edges… 
2013
2013
Total Embedding Distributions of Circular Ladders
The total embedding polynomial of a graph G is the bivariate polynomial IG(x,y)=∑i=0∞aixi+∑j=1∞bjyj,where ai is the number of… 
2010
2010
The Binding Number of the Corona of the Ladder Graph and its Complement with the Complete Graph
The binding number of several interesting types of graphs has been studied extensively in the literature. In general, the… 
2002
2002
Optimal 1-edge fault-tolerant designs for ladders
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)