Log in

Relevant bibliographies by topics / Triangular Snake Graphs

Contents

Journal articles
Book chapters
Conference papers

Academic literature on the topic '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 '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 "Triangular Snake Graphs"

1

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

2

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

3

Kaviya, S., G. Mahadevan, and C. Sivagnanam. "Generalizing TCCD-Number For Power Graph Of Some Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 115–23. http://dx.doi.org/10.17485/ijst/v17sp1.243.

Full text

Abstract:

Objective: Finding the triple connected certified domination number for the power graph of some peculiar graphs. Methods: A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were eq

APA, Harvard, Vancouver, ISO, and other styles

4

Shahid, Malik Muhammad Suleman, Muhammad Ishaq, Anuwat Jirawattanapanit, and Khanyaluck Subkrajang. "Depth and Stanley depth of the edge ideals of multi triangular snake and multi triangular ouroboros snake graphs." AIMS Mathematics 7, no. 9 (2022): 16449–63. http://dx.doi.org/10.3934/math.2022900.

Full text

Abstract:

<abstract><p>In this paper, we study depth and Stanley depth of the quotient rings of the edge ideals associated to triangular and multi triangular snake and triangular and multi triangular ouroboros snake graphs. In some cases, we find exact values, otherwise, we find tight bounds. We also find lower bounds for the edge ideals of triangular and multi triangular snake and ouroboros snake graphs and prove a conjecture of Herzog for all edge ideals we considered.</p></abstract>

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

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

7

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

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

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

10

S. K. Vaidya and N B Vyas. "Product cordial labeling for alternate snake graphs." Malaya Journal of Matematik 2, no. 03 (2014): 188–96. http://dx.doi.org/10.26637/mjm203/002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Triangular Snake Graphs"

1

Parmar, Dharamvirsinh, and Bharat Suthar. "Rainbow Vertex Connection Number of a Class of Triangular Snake Graph." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "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

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

3

Afiya, Syeda, and M. Rajesh. "Embedding (K9 – C9) n into 2-CAT and triangular snake graph." In MATHEMATICS AND ITS APPLICATIONS IN TECHNOLOGY. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0225049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!