Relevant bibliographies by topics / Ladder graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Ladder graph'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Ladder graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Ladder graph"

1

Utomo, Robertus Heri, Heru Tjahjana, Bambang Irawanto, and Lucia Ratnasari. "PELABELAN TOTAL SUPER TRIMAGIC SISI PADA BEBERAPA GRAF." Journal of Fundamental Mathematics and Applications (JFMA) 1, no. 1 (2018): 52. http://dx.doi.org/10.14710/jfma.v1i1.4.

Full text
Abstract:
This paper is addressed to discuss the edge super trimagic total labeling on some graphs which are corona, double ladder, quadrilateral snake and alternate triangular snake. The main results are the edge super trimagic total label for these graphs. Furthermore, it was prove that corona is a graph with edge super trimagic total labeling, a double ladder with odd ladder is graph with edge super trimagic total labeling, quadrilateral snake is a graph with edge super trimagic total labeling and finally an alternate triangular snake with odd ladder is graph with edge super trimagic total labeling.
APA, Harvard, Vancouver, ISO, and other styles
2

Alanazi, A. M., G. Muhiuddin, A. R. Kannan, and V. Govindan. "New Perspectives on Classical Meanness of Some Ladder Graphs." Journal of Mathematics 2021 (June 30, 2021): 1–14. http://dx.doi.org/10.1155/2021/9926350.

Full text
Abstract:
In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples.
APA, Harvard, Vancouver, ISO, and other styles
3

Rajesh Kannan, A., S. Murali Krishnan, Karuppusamy Loganathan, Nazek Alessa, and M. Hymavathi. "Enhanced Effectiveness in Various Ladder Graphs Based on the F-Centroidal Meanness Criterion." Mathematics 11, no. 14 (2023): 3205. http://dx.doi.org/10.3390/math11143205.

Full text
Abstract:
Graph labeling allows for the representation of additional attributes or properties associated with the vertices, edges, or both of graphs. This can provide a more comprehensive and detailed representation of the system being modeled, allowing for a richer analysis and interpretation of the graph. Graph labeling in ladder graphs has a wide range of applications in engineering, computer science, physics, biology, and other fields. It can be applied to various problem domains, such as image processing, wireless sensor networks, VLSI design, bioinformatics, social network analysis, transportation
APA, Harvard, Vancouver, ISO, and other styles
4

M., I. Moussa, and Badr E.M. "LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFUL." International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) 8, no. 1 (2019): 1–8. https://doi.org/10.5281/zenodo.3351927.

Full text
Abstract:
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show that the ladder graph Ln with m-pendant Ln  mk1 is odd graceful. We also show that the subdivision of ladder graph Ln with m-pendant S(Ln)  mk1 is odd graceful. Finally, we prove that all the subdivision of triangular snakes ( k   snake ) with pendant edges 1 ( ) k S snake mk    are odd graceful.
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Gujun, Min Xiao, and Feng Zhu. "Counting Spanning Trees in The Ladders." Asian Research Journal of Mathematics 19, no. 11 (2023): 142–58. http://dx.doi.org/10.9734/arjom/2023/v19i11761.

Full text
Abstract:
Aims: In order to study the rule of entropy in different graph transformations, this paper introduces and further generalizes the ladder graph from different perspectives, including pinwheel ladders and 3-dimensional ladders. Then the problem of entropy comes down to the calculation of spanning trees in these graphs. Place and Duration of Study: School of Mathematical Sciences, Jiangsu University, between January 2023 and October 2023. Methodology: A method by seeking similar terms was generalized to help study the essential principle in these graphs. By similarity diagonalization and computer
APA, Harvard, Vancouver, ISO, and other styles
6

Ratnasari, Lucia, and Yeni Susanti. "Total edge irregularity strength of ladder-related graphs." Asian-European Journal of Mathematics 13, no. 04 (2018): 2050072. http://dx.doi.org/10.1142/s1793557120500722.

Full text
Abstract:
An edge irregular total [Formula: see text]-labeling on simple and undirected graph [Formula: see text] is a map [Formula: see text] such that for any different edge [Formula: see text] and [Formula: see text] their weights [Formula: see text] and [Formula: see text] are distinct. The minimum [Formula: see text] for which the graph [Formula: see text] has an edge irregular total [Formula: see text]-labeling is called the total edge irregularity strength of [Formula: see text] and is denoted by tes[Formula: see text]. In this paper, we determine the exact value of the total edge irregularity st
APA, Harvard, Vancouver, ISO, and other styles
7

Almotairi, Sultan, Olayan Alharbi, Zaid Alzaid, Yasser M. Hausawi, Jaber Almutairi, and Basma Mohamed. "COMPUTING THE CONNECTED DOMINANT METRIC DIMENSION OF DIFFERENT GRAPHS." Advances and Applications in Discrete Mathematics 41, no. 6 (2024): 505–20. http://dx.doi.org/10.17654/0974165824034.

Full text
Abstract:
We determine the exact value of the connected domination metric dimension of some particular classes of graphs, such as the jewel graph, tortoise graph, globe graph, triangular book graph, and open diagonal ladder graph.
APA, Harvard, Vancouver, ISO, and other styles
8

Riandy Fauzi Manik and Marlina Setia Sinaga. "Pelabelan Total Titik Ajaib Pada Graf Tangga." JURNAL RISET RUMPUN MATEMATIKA DAN ILMU PENGETAHUAN ALAM 2, no. 2 (2023): 147–61. http://dx.doi.org/10.55606/jurrimipa.v2i2.1533.

Full text
Abstract:
The labeling of a graph is a mapping that pairs the elements in the graph into positive integers. In this thesis, it discusses how the magic total point labeling algorithm on the ladder graph and the ladder graph and how the magic total point labeling on the ladder graph and the adder graph uses the magic square matrix modification using the durer method. Where the elements of the result of this magic square matrix modification will be used as point labels on the ladder graph and the ladder graph.
APA, Harvard, Vancouver, ISO, and other styles
9

D, Vijayalakshmi. "B-CHROMATIC NUMBER OF CENTRAL GRAPH OF LADDER GRAPH AND COMPLETE GRAPH." Kongunadu Research Journal 1, no. 1 (2014): 27–28. http://dx.doi.org/10.26524/krj309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

LARASATI, MARETA SEKAR, LUH PUTU IDA HARINI, and I. WAYAN SUMARJAYA. "GRAPH TANGGA DAN SIFAT-SIFATNYA." E-Jurnal Matematika 12, no. 3 (2023): 177. http://dx.doi.org/10.24843/mtk.2023.v12.i03.p416.

Full text
Abstract:
Ladder Graph is one type of connected and simple graph that has its own uniqueness. The aim of this research is to find the k-deficiency of points in the spanning tree in the ladder graph. Calculation of k-deficiency is carried out for each additional step, starting from the second ladder ( L2), up to the nth Ladder (Ln). Calculations are based on a representative spanning tree on each ladder. In the end, we get a number pattern from the second ladder onwards which is then proven by mathematical induction, for the calculation of each step up the ladder. In this study, the pattern of k-deficien
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Ladder graph"

1

Gardner, Bradley. "Italian Domination on Ladders and Related Products." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3509.

Full text
Abstract:
An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \to \{0,1,2\}$, and for each vertex $v \in V$ for which $f(v) = 0$, we have $\sum_{u\in N(v)}f(u) \geq 2$. The weight of an Italian dominating function is $f(V) = \sum_{v\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms,
APA, Harvard, Vancouver, ISO, and other styles
2

Sterling, Christopher Kent. "Liar's Domination in Grid Graphs." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1415.

Full text
Abstract:
As introduced by Slater in 2008, liar's domination provides a way of modeling protection devices where one may be faulty. Assume each vertex of a graph G is the possible location for an intruder such as a thief. A protection device at a vertex v is assumed to be able to detect the intruder at any vertex in its closed neighborhood N[v] and identify at which vertex in N[v] the intruder is located. A dominating set is required to identify any intruder's location in the graph G, and if any one device can fail to detect the intruder, then a double-dominating set is necessary. Stronger still, a liar
APA, Harvard, Vancouver, ISO, and other styles
3

Cheng, Chung-Yuan, and 鄭仲元. "Automated Object-based Transformation: from Marked Graphs to Ladder Diagrams." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/10590297546637976965.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>99<br>An automated object-based transformation based on JAXB technology is proposed for transforming a given marked graph to a desired ladder diagram. Essentially there are five major steps involved in this transformation. First, a marked graph is easily transformed into a Petri Net Markup Language (PNML) document through traditional XML technology. Second, the PNML file is transformed into objects automatically using JAXB technology. Third, the marked graph oriented objects are transformed into ladder diagram oriented objects. Fourth, the ladder diagram objects ar
APA, Harvard, Vancouver, ISO, and other styles
4

Chang, Shun-Lung, and 張舜龍. "Rule-Based Transformation Method for Generating Ladder Diagrams from Eulerian Marked Graphs." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/32674220117943135977.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>100<br>Eulerian Marked Graph (EMG) is a graphic design tool for analyzing the interactive behavior of an Automated Manufacturing System (AMS). In contrast, Ladder Diagram (LD) is a graphic implementation tool for controlling an AMS. In this thesis, three graph transformation rules are proposed to transform EMGs into LDs. For automating the graph transformation process, three rules are implemented at the object level. Moreover, since both graphic tools can be uniquely represented through extensible markup language documents and objects, three graph transformation ru
APA, Harvard, Vancouver, ISO, and other styles
5

Wei, Liang-Ying, and 魏良縈. "Analysis of XML Tree Transformation Method:from Marked Ladder Diagrams to Marked Graphs." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/77521150482565124533.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>98<br>Petri Net is an excellent mathematical model for improving the performance of shop floor control system. In contrast, the most used controller on shop floor is ladder diagram because of its lower cost. If it is possible to transform ladder diagrams into Petri Nets automatically, then we can build their mathematical models for shop floor controllers easily. In this thesis, XML trees named PNML document and PLCopenXML document are used to represent Petri Nets and ladder diagrams, respectively. Then an XML tree transformation method has been developed for transf
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Ladder graph"

1

Muralt, Arnold. The design of switched-capacitor ladder filters: Based on doubly- terminated two-pair signal-flow graphs. Hartung-Gorre Verlag, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hexagonal Graph Paper African Gray Parrot Real Ladies Funny Quote. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Press, Renol. Composition Notebook: Small Graph Grid Notebook , Cute Gift Ideas for Girls and Ladies. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Muralt, Arnold. The design of switched-capacitor ladder filters based on doubly- terminated two-pair signal-flow graphs. 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hexagonal Graph Paper - Womens Funny Bitch Quote for Women Ladies Cute Bad Ass Bitch. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

carr, carra. Hexagonal Graph Paper Womens Funny Bitch Quote for Women Ladies Cute Bad Ass Bitch. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hexagonal Graph Paper Womens Funny Bitch Quote for Women Ladies Cute Bad Ass Bitch. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Notebooks, Funny. Grab Those Balls Ladies: 120 Pages I 6x9 I Graph Paper 5x5 I Funny Vintage Bowl, Sport & Competition Gifts. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Notebooks, Funny. Grab Those Balls Ladies: 120 Pages I 6x9 I Graph Paper 4x4 I Funny Vintage Bowl, Sport & Competition Gifts. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Publishing, Frank H. Kids- Notebook 120 Pages : 6''x 9'' Checkerd Graph Paper: Future Ladies Man, Current Mama's Boy - Perfekt As a Log Notebook, Diarys, Day Planner, Journal and to-Do List for Work, University or at School. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Ladder graph"

1

Rathod, Neha B., and Kailas K. Kanani. "V 4 - Cordial Labeling of Some Ladder and Book related Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aksenov, Vitaly, Anton Paramonov, Iosif Salem, and Stefan Schmid. "Self-adjusting Linear Networks with Ladder Demand Graph." In Structural Information and Communication Complexity. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-32733-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cibulka, Josef, Pu Gao, Marek Krčál, Tomáš Valla, and Pavel Valtr. "Polynomial bounds on geometric Ramsey numbers of ladder graphs." In The Seventh European Conference on Combinatorics, Graph Theory and Applications. Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chaplick, Steven, Steven Kelk, Ruben Meuwese, Matúš Mihalák, and Georgios Stamoulis. "Snakes and Ladders: A Treewidth Story." In Graph-Theoretic Concepts in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43380-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Selvan, J. Senthamizh, R. Jahir Hussain, and V. Mahalakshmi. "Range Labeling for Some Ladder Graphs." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0185-1_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bao, Shitang, Zhiwen Wang, and Fei Wen. "Vertex Distinguishing Total Coloring of Ladder Graphs." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19853-3_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lari, I. "Connected Maximum Split Clustering of Ladder Graphs." In Studies in Classification, Data Analysis, and Knowledge Organization. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-55991-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Haribabu, Rebekal, and Sharmila Mary Arul. "Domination Equitable Coloring for Family of Ladder Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-77764-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sharma, Sunny Kumar, and Vijay Kumar Bhat. "On Fault-Tolerant Metric Dimension of Heptagonal Circular Ladder and Its Related Graphs." In Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7014-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Reuter, Julia, Hani Elmestikawy, Fabien Evrard, Sanaz Mostaghim, and Berend van Wachem. "Graph Networks as Inductive Bias for Genetic Programming: Symbolic Models for Particle-Laden Flows." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-29573-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Ladder graph"

1

Zhu, Wenrui, Donghui Shi, Tao Hu, and Bo Wu. "SlowFast Adaptive Graph Convolutional Network with Multi-Modal Feature Aggregation for Skeleton-Based Action Recognition: Case Study of Human Ladder Climbing." In 2024 International Joint Conference on Neural Networks (IJCNN). IEEE, 2024. http://dx.doi.org/10.1109/ijcnn60899.2024.10650370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Faria, Luerbio, Mauro Nigro, and Diana Sasaki. "The line graphs of Möbius ladder graphs are Type 1." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2024. http://dx.doi.org/10.5753/etc.2024.2421.

Full text
Abstract:
A k-total coloring of G is an assignment of k colors to its elements (vertices and edges) such that adjacent or incident elements have distinct colors. The total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring. If the total chromatic number of G is ∆(G) + 1, then we say that G is Type 1. The line graph of G, denoted by L(G), is the graph whose vertex set is the edge set of G and two vertices of the line graph of G are adjacent if the corresponding edges are adjacent in G. In this paper, we prove that the line graphs of Möbius ladder graphs, L(M2n), ar
APA, Harvard, Vancouver, ISO, and other styles
3

Hu, Ruiqi, Shirui Pan, Jing Jiang, and Guodong Long. "Graph Ladder Networks for Network Classification." In CIKM '17: ACM Conference on Information and Knowledge Management. ACM, 2017. http://dx.doi.org/10.1145/3132847.3133124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Omai, M. M., C. N. Campos, and A. G. Luiz. "The (2,1)-total number of near-ladder graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16390.

Full text
Abstract:
A $(2,1)$-total labelling of a simple graph $G$ is a function $\pi \colon V(G)\cup E(G) \to \{0, \ldots, k\}$ such that: $\pi(u) \neq \pi(v)$ for $uv \in E(G)$; $\pi(uv) \neq \pi(vw)$ for $uv, vw \in E(G)$; and $|\pi(uv)-\pi(u)| \geq 2$ and $|\pi(uv)-\pi(v)| \geq 2$ for $uv \in E(G)$. The $(2,1)$-total number $\lambda_2^t(G)$ of $G$ is the least $k$ for which $G$ admits such a labelling. In 2008, Havet and Yu conjectured that $\lambda_2^t(G)\leq 5$ for every connected graph $G \not\cong K_4$ with $\Delta(G) \leq 3$. We prove that, for near-ladder graphs, $\lambda_2^t(G)=5$, verifying Havet and
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Jun, Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, and Xiaokui Xiao. "Private Release of Graph Statistics using Ladder Functions." In SIGMOD/PODS'15: International Conference on Management of Data. ACM, 2015. http://dx.doi.org/10.1145/2723372.2737785.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bigelow, Alex, and Megan Monroe. "Jacob's Ladder: The User Implications of Leveraging Graph Pivots." In 2019 IEEE Pacific Visualization Symposium (PacificVis). IEEE, 2019. http://dx.doi.org/10.1109/pacificvis.2019.00014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Adam, Geiby Agatha, Chriestie E. J. C. Montolalu, and Mans Lumiu Mananohas. "Decomposition of dot comb product ladder graph Tn and lollipop graph La,b." In THE 2ND INTERNATIONAL CONFERENCE ON NATURAL SCIENCES, MATHEMATICS, APPLICATIONS, RESEARCH, AND TECHNOLOGY (ICON-SMART 2021): Materials Science and Bioinformatics for Medical, Food, and Marine Industries. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0119141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bao, Ya-dan, Xue-wen Ding, and Yan-min Song. "Conversion from PLC Ladder Diagram to the Assembly Language Based on AOV Graph." In 2012 5th International Conference on Intelligent Networks and Intelligent Systems (ICINIS). IEEE, 2012. http://dx.doi.org/10.1109/icinis.2012.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dewi, R. K., M. Roswitha, and T. S. Martini. "H-Supermagic labeling on corona product of fan and ladder graph with a path." In PROCEEDINGS OF THE 3RD INTERNATIONAL SYMPOSIUM ON CURRENT PROGRESS IN MATHEMATICS AND SCIENCES 2017 (ISCPMS2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5064235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saffren, S., and D. Angel. "Acyclic matching in ladder graphs." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0108719.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Ladder graph"

1

Deryagina, Madina, and Ilia Mednykh Mednykh. On the Jacobian Group for Möbius Ladder and Prism Graphs. GIQ, 2014. http://dx.doi.org/10.7546/giq-15-2014-117-126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Ladder graph' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography