Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,215,035 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Chromatic polynomial
Edge-graceful labeling
Forbidden graph characterization
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The local metric dimension of starbarbell graph, Km ? Pn graph, and M¨obius ladder graph
Wahyu Tri Budianto
2018
Corpus ID: 67845155
Abstract.For an ordered set W = {w1, w2, ..., wn} of n distinct vertices in a nontrivial connected graph G, the representation of…
Expand
2018
2018
ACYCLIC AND STAR COLORING OF DUPLICATE GRAPH OF LADDER GRAPH
C. Sarma
,
K. Thirusangu
2018
Corpus ID: 127636563
I n this paper we present acyclic and star coloring algorithms to color the vertices of Duplicate graph of ladder L m . Also we…
Expand
2017
2017
H?Supermagic Labeling On Corona Product Of Fan, Ladder, And Windmill Graph With A Path
R. K. Dewi
2017
Corpus ID: 59148708
Abstract. A simple graph G = (V;E) admits an H-labeling if every edge e ∈ E(G) belongs toa subgraph of G isomorphic to H…
Expand
2017
2017
F – root square mean labeling of some cycle related graphs
S. Arockiaraj
,
A. Baskar
,
A. Kannan
2017
Corpus ID: 55589574
A function f is called a F-Root Square Mean labeling of a graph E V G , with p vertices and q edges if 1 , , 3 , 2…
Expand
2016
2016
• 3-EQUITABLE AND 3-CORDIAL LABELING IN DUPLICATE GRAPH OF SOME GRAPHS
P. V. Kumar
,
P. Ulaganathan
,
K. Thirusangu
2016
Corpus ID: 123723611
I n this paper, we prove that the duplicate graph of ladder graph, cycle graph, circular twig graph and extended duplicate graph…
Expand
2015
2015
Efficiency and Betweenness Centrality of Graphs and some Applications
Bryan Ek
2015
Corpus ID: 59446471
The distance dG(i, j) between any two vertices i and j in a graph G is the minimum number of edges in a path between i and j. If…
Expand
2014
2014
The Radio Number of Grid Graphs
Tian-Shun Jiang
2014
Corpus ID: 116927778
The radio number problem uses a graph-theoretical model to simulate optimal frequency assignments on wireless networks. A radio…
Expand
2014
2014
The Analysis of Air Circulation on Coffee Plantation Based on the Level of Plants Roughness and Diamond Ladder Graph Cropping Pattern Using Finite Volume Method
A. Fatahillah
,
Dafik
,
Ervin Eka Riastutik
,
Susanto
2014
Corpus ID: 73632521
One of the Indonesia major export commodity is a coffee bean. The field expansion have been focused several years ago to increase…
Expand
2013
2013
On Mean Graphs
R. Vasuki
,
A. Arockiaraj
2013
Corpus ID: 17796626
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…
Expand
2013
2013
Complexity of Some Graphs Generated by Ladder Graph
S. Daoud
,
A. Elsonbaty
2013
Corpus ID: 122004259
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can…
Expand