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
On Harmonious Graphs
Let G = (V (G), E(G)) be a graph with q edges. A function f is called harmonious labeling of graph G if f: V →¨{0, 1, 2,…, q-1… 
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… 
2018
2018
The local metric dimension of starbarbell graph, Km ? Pn graph, and M¨obius ladder graph
Abstract.For an ordered set W = {w1, w2, ..., wn} of n distinct vertices in a nontrivial connected graph G, the representation of… 
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… 
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
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
Metric problems on graphs
Some properties of homometric sets are known in Music Theory for at least fifty years [16]. We define homometric sets in graphs… 
2012
2012
The restricted detour polynomials of a hexagonal chain and a ladder graph
The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u-v path P… 
1996
1996
The philosophers' process on ladder graphs
The Philosophers' Process is a Markovian version of the famous Dining Philosophers Problem introduced by Dijkstra as a model for… 
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)