Relevant bibliographies by topics / Double Triangular Snake Graphs

Contents

  1. Journal articles
  2. Conference papers

Academic literature on the topic 'Double Triangular Snake Graphs'

Author: Grafiati
Published: 3 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 'Double Triangular Snake Graphs.'

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 "Double Triangular Snake Graphs"

1

Barasara, Chirag, and Palak Prajapati. "Antimagic Labeling for Some Snake Graphs." Proyecciones (Antofagasta) 43, no. 2 (2024): 521–37. http://dx.doi.org/10.22199/issn.0717-6279-6005.

Full text
Abstract:
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake, double alternate quadrilateral snake.
APA, Harvard, Vancouver, ISO, and other styles
2

Anitha, H., S. K. Sowjanya, Shanmukha B, and K. R. Karthik. "K - Power-3 Heronian Mean Labeling of Graphs." International Journal of Mathematics and Computer Research 12, no. 11 (2024): 4571–76. https://doi.org/10.5281/zenodo.14191351.

Full text
Abstract:
We describe a function  as  – Power 3. If constitute both the induced edge labelling and take be an injective function and express it as, then a graph's Heronian Mean Labelling  with p nodes and q lines is  or  with distinct edge labels. In this manuscript we have proved the – Power -3 Mean labeling behaviour of Path, Twig Graph, Triangular ladder . We have also investigated  - Super power -3 Heronian Mean labelling of graghs. Also, we prove that  is not – Power - 3 Heronian Mean graph and  - Super power -3 Heronian Mean labelling of Sn
APA, Harvard, Vancouver, ISO, and other styles
3

Ponraj, R., M. Maria Adaickalam, and R. Kala. "3-Difference cordial labeling of some path related graphs." Indonesian Journal of Combinatorics 2, no. 1 (2018): 1. http://dx.doi.org/10.19184/ijc.2018.2.1.1.

Full text
Abstract:
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f(u) − f(v)|. f is called k-difference cordial labeling of G if |vf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x, ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of triangular snake, alternat
APA, Harvard, Vancouver, ISO, and other styles
4

A. Anat Jaslin Jini. "Relatively Prime Domination Number in Triangular Snake Graphs." Advances in Nonlinear Variational Inequalities 28, no. 2 (2024): 159–65. http://dx.doi.org/10.52783/anvi.v28.1912.

Full text
Abstract:
A set S⊆V is said to be relatively prime dominating set if it is a dominating set with at least two elements and for every pair of vertices u and v in S, (deg⁡(u),deg⁡〖(v))〗=1 and the minimum cardinality of a relatively prime dominating set is called relatively prime domination number and it is denoted by γ_rpd (G). If there is no such pair exist, then γ_rpd (G)=0. For a finite undirected graph G(V,E) and a subset V, the switching of G by is defined as the graph (V, ) which is obtained from G by removing all edges between and its complement V- and adding as edges all non-edges between and V- .
APA, Harvard, Vancouver, ISO, and other styles
5

Princy Kala, V. "k-super cube root cube mean labeling of graphs." Proyecciones (Antofagasta) 40, no. 5 (2021): 1097–116. http://dx.doi.org/10.22199/issn.0717-6279-4258.

Full text
Abstract:
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex labeling f is defined by f ∗ (e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗ (e) : e ∈ E(G)} = {k, k + 1, k + 2, . . . , p + q + k − 1}, then f is called a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I introduce k-super cube root cube mean labeling and prove the existence of this labeling to the graphs viz., triangular snake
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

K.Sunitha. "Radio Labeling of Double Triangular Snake Graphs." Annals of Pure and Applied Mathematics 37, no. 49 (2023): 63–71. http://dx.doi.org/10.22457/apam.v27n2a04905.

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

Jeyanthi, P., A. Maheswari, and M. Vijayalakshmi. "3-product cordial labeling of some snake graphs." Proyecciones (Antofagasta) 38, no. 1 (2019): 13–30. https://doi.org/10.22199/issn.0717-6279-3409.

Full text
Abstract:
Let G be a (p,q) graph. A mapping ? : V (G) → {0, 1, 2} is called 3-product cordial labeling if |v?(i) − v? (j)| ≤ 1 and |e? (i) − e? (j)| ≤ 1 for any i, j ∈ {0, 1, 2},where v? (i) denotes the number of vertices labeled with i, e? (i) denotes the number of edges xy with ?(x)?(y) ≡ i(mod3). A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we investigate the 3-product cordial behavior of alternate triangular snake, double alternate triangular snake and triangular snake graphs.
APA, Harvard, Vancouver, ISO, and other styles
9

ELrokh, Ashraf, Elsayed Badr, Mohammed M. Ali Al-Shamiri, and Shimaa Ramadhan. "Upper Bounds of Radio Number for Triangular Snake and Double Triangular Snake Graphs." Journal of Mathematics 2022 (May 16, 2022): 1–8. http://dx.doi.org/10.1155/2022/3635499.

Full text
Abstract:
A radio labeling of a simple connected graph G = V , E is a function h : V ⟶ N such that h x − h y ≥ diam G + 1 − d x , y , where diam G is the diameter of graph and d(x, y) is the distance between the two vertices. The radio number of G , denoted by rn G , is the minimum span of a radio labeling for G . In this study, the upper bounds for radio number of the triangular snake and the double triangular snake graphs are introduced. The computational results indicate that the presented upper bounds are better than the results of the mathematical model provided by Badr and Moussa in 2020. On the c
APA, Harvard, Vancouver, ISO, and other styles
10

A., Josephine Lissie, and Jaya S. "TRIPLE CONNECTED DOMINATION NUMBER FOR SOME SPECIAL GRAPHS." International Journal of Current Research and Modern Education, Special Issue (August 11, 2017): 10–12. https://doi.org/10.5281/zenodo.841822.

Full text
Abstract:
A subset <em>S</em> of <em>V</em> of a nontrivial connected graph <em>G</em> is said to be a triple connected dominating set (tcd-set), if <em>S</em> is a dominating set and the induced subgraph<em>S</em>is triple connected. The minimum cardinality taken over all triple connected dominating sets is called the triple connected domination number of <em>G</em> and is denoted by γ<em><sub>tc</sub></em>(<em>G</em>). Any triple connected dominating set with γ<em><sub>tc</sub></em> vertices is called a γ<em><sub>tc</sub></em>-set of <em>G</em>. In this paper we obtain triple connected domination numb
APA, Harvard, Vancouver, ISO, and other styles
More sources

Conference papers on the topic "Double Triangular Snake Graphs"

1

Rocha, Aleffer, Sheila M. Almeida, and Leandro M. Zatesko. "The Rainbow Connection Number of Triangular Snake Graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11091.

Full text
Abstract:
Rainbow coloring problems, of noteworthy applications in Information Security, have been receiving much attention last years in Combinatorics. The rainbow connection number of a graph G is the least number of colors for a (not necessarily proper) edge coloring of G such that between any pair of vertices there is a path whose edge colors are all distinct. In this paper we determine the rainbow connection number of the triple triangular snake graphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Xi, Yue, and Wingning Li. "On Prime Cordial Labelings of Double Triangular Snake." In 2016 9th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2016. http://dx.doi.org/10.1109/iscid.2016.1066.

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

Santhanaraju, C., V. J. Sudhakar, and V. Navaneethakumar. "Cube difference labelling for some alternate triangular snake, cycle and star related graphs." In CONTEMPORARY INNOVATIONS IN ENGINEERING AND MANAGEMENT. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0150579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Double Triangular Snake Graphs' 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