Zaloguj się

Gotowe bibliografie tematyczne / Double star graph

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Części książek
Streszczenia konferencji

Gotowa bibliografia na temat „Double star graph”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Double star graph”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Double star graph"

1

P, Sumathi, and Geetha Ramani G. "Arithmetic Sequential Graceful Labeling on Star Related Graphs." Indian Journal of Science and Technology 15, no. 44 (2022): 2356–62. https://doi.org/10.17485/IJST/v15i44.1863.

Pełny tekst źródła

Streszczenie:

Abstract <strong>Objectives:</strong> To identify a new family of Arithmetic sequential graceful graphs. <strong>Methods:</strong> The methodology involves mathematical formulation for labeling of the vertices of a given graph and subsequently establishing that these formulations give rise to arithmetic sequential graceful labeling. <strong>Findings:</strong> In this study, we analyzed some star related graphs namely Star graph, Ustar, t-star, and double star proved that these graphs possess Arithmetic sequential graceful labeling. <strong>Novelty:</strong> H

Style APA, Harvard, Vancouver, ISO itp.

2

Karthikeyan C. "Various Labelling for Double Star Graph." Journal of Information Systems Engineering and Management 10, no. 18s (2025): 273–77. https://doi.org/10.52783/jisem.v10i18s.2912.

Pełny tekst źródła

Streszczenie:

In this work, we introduce labeling techniques for the double star graph, a basic graph theory structure. In particular, we concentrate on calculating two different kinds of labeling: fortunate labeling and correct labeling. Adhering to the restrictions of vertex labeling in graph theory, appropriate labeling guarantees that neighboring vertices receive unique labels. A more recent and interesting idea is the fortunate labelling, which gives vertices positive numbers so that the labels on neighboring vertices add up to a unique value for each edge. We calculate and examine various labeling met

Style APA, Harvard, Vancouver, ISO itp.

3

Cao, Jingdong, Shumin Zhang, Chengfu Ye, and Tianxia Jia. "Double-Star Isolation of Maximal Outerplanar Graphs ∗." Journal of Physics: Conference Series 2660, no. 1 (2023): 012023. http://dx.doi.org/10.1088/1742-6596/2660/1/012023.

Pełny tekst źródła

Streszczenie:

Abstract In the graph G = (V, E), V represents the set of vertices and E represents the set of edges. ℱ represents a family of graphs. A subset S ⊆ V is considered an ℱ -isolating set if G[V\NG[S]] does not contain F as a subgraph for all F ∈ ℱ. The ℱ-isolation number of the graph G, denoted by 𝜄(G, ℱ), is defined as the minimum cardinality of an ℱ-isolating set in G. If the family ℱ consists of a single graph H, then the subset S is referred to as an H-isolating set. The H-isolation number of the graph G, denoted by 𝜄 H (G), is defined as the minimum cardinality of an H-isolating set in G. Ma

Style APA, Harvard, Vancouver, ISO itp.

4

Vivin.J, Vernold, Venkatachalam M., and Kaliraj K. "Harmonious coloring on double star graph families." Tamkang Journal of Mathematics 43, no. 2 (2012): 153–58. http://dx.doi.org/10.5556/j.tkjm.43.2012.675.

Pełny tekst źródła

Streszczenie:

In this present paper, we have proved for the line graph of double star graph, the harmonious chromatic number and the achromatic number are equal. As a motivation this work can be extended by classifying the different families of graphs for which these two numbers are equal.

Style APA, Harvard, Vancouver, ISO itp.

5

Venkatacha, M., N. Mohanapriy, and J. Vernold Vivin. "Star Coloring on Double Star Graph Families." Journal of Modern Mathematics and Statistics 5, no. 1 (2011): 33–36. http://dx.doi.org/10.3923/jmmstat.2011.33.36.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Sugeng, K. A., Z. Z. Barack, N. Hinding, and R. Simanjuntak. "Modular Irregular Labeling on Double-Star and Friendship Graphs." Journal of Mathematics 2021 (December 28, 2021): 1–6. http://dx.doi.org/10.1155/2021/4746609.

Pełny tekst źródła

Streszczenie:

A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2 , … , k such that the weights of all vertices are different. The vertex weight is the sum of its incident edge labels, and all vertex weights are calculated with the sum modulo n . The modular irregularity strength is the minimum largest edge label such that a modular irregular labeling can be done. In this paper, we construct a modular irregular labeling of two classes of graphs that are biregular; in this case

Style APA, Harvard, Vancouver, ISO itp.

7

Shirkol, Shailaja S., Pavitra P. Kumbargoudra, and Meenal M. Kaliwal. "DOUBLE ROMAN DOMINATION NUMBER OF MIDDLE GRAPH." South East Asian J. of Mathematics and Mathematical Sciences 18, no. 03 (2022): 369–80. http://dx.doi.org/10.56827/seajmms.2022.1803.31.

Pełny tekst źródła

Streszczenie:

For any graph G(V, E), a function f : V (G) 0, 1, 2, 3 is called Double Roman dominating function (DRDF) if the following properties holds, If f (v) = 0, then there exist two vertices v1, v2 ∈ N (v) for which f (v1) = f (v2) = 2 or there exist one vertex u ∈ N (v) for which f (u) = 3.∈ If f (v) = 1, then there exist one vertex u N (v) for which f (u) = 2 or Σ f (u) = 3. The weight of DRDF is the value w(f ) = v∈V (G) f (v). The minimum weight among all double Roman dominating function is called double Roman domination number and is denoted by γdR(G). In this article we initiated research on do

Style APA, Harvard, Vancouver, ISO itp.

8

P., Kavitha*1 &. A. Rajasekaran2. "PRIME LABELING IN DUPLICATE GRAPH OF SOME GRAPHS." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 6, no. 2 (2019): 35–45. https://doi.org/10.5281/zenodo.2558187.

Pełny tekst źródła

Streszczenie:

A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding such that the labels of each pair of adjacent vertices are relatively prime. A graph which admits prime labeling is called a prime graph. In this paper we prove that the duplicate graph of the path the duplicate graph of cycle the duplicate graph of star  the duplicate graph of double star  the duplicate graph of comb graph  and the duplicate graph of bistar graph for all integers  are prime labeling

Style APA, Harvard, Vancouver, ISO itp.

9

Senthamizh selvan J and Jahir Hussain R. "Coefficient of Range Labeling of Some Graphs." Journal of Computational Mathematica 7, no. 2 (2023): 044–56. http://dx.doi.org/10.26524/cm175.

Pełny tekst źródła

Streszczenie:

The coefficient of range labeling is a new type of labeling since it was introduced in 2022 by Senthamizh Selvan and Jahir Hussain. In this paper, we obtained a coefficient of range labeling for the path graph, cycle graph, sun graph, and double star graph is coefficient of range graph. We can also determine the coefficient of range value of the path graph, cycle graph, sun graph, and double star graph.

Style APA, Harvard, Vancouver, ISO itp.

10

Kavitha, K., and N. G. David. "Dominator Coloring on Star and Double Star Graph Families." International Journal of Computer Applications 48, no. 3 (2012): 22–25. http://dx.doi.org/10.5120/7328-0185.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Double star graph"

1

Lee, Ming-Ju, and 李明茹. "The double star decomposition of complete bipartite graphs, crowns, complete graphs." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/46497534778695986943.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Double star graph"

1

Janakiraman, T. N., and A. Senthil Thilak. "A Weight Based Double Star Embedded Clustering of Homogeneous Mobile Ad Hoc Networks Using Graph Theory." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17878-8_33.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Akitaya, Hugo A., Brad Ballinger, Mirela Damian, et al. "Toward Unfolding Doubly Covered n-Stars." In Discrete and Computational Geometry, Graphs, and Games. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90048-9_10.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Muya, James Githinji, G. Sobhalatha, G. Charankumar, Upendra Rajak, and P. Raju. "Edge Irregularity Strength of Graphs Produced Utilizing M-Super Subdivision of Stars and Double Stars." In Lecture Notes in Mechanical Engineering. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7909-4_90.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Double star graph"

1

Fran, Fransiskus, Yuda Praja, and Nilamsari Kusumastuti. "Equitable chromatic number in barbell graph, butterfly graph, and double star graph." In THE 8TH PROGRESSIVE AND FUN EDUCATION INTERNATIONAL CONFERENCE 2023. AIP Publishing, 2025. https://doi.org/10.1063/5.0262940.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Indriati, Diari, Widodo, Indah E. Wijayanti, and Kiki A. Sugeng. "On total irregularity strength of star graphs, double-stars and caterpillar." In PROCEEDINGS OF THE 7TH SEAMS UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2015: Enhancing the Role of Mathematics in Interdisciplinary Research. AIP Publishing LLC, 2016. http://dx.doi.org/10.1063/1.4940809.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Roswitha, Mania, Sri Kuntari, Dwi Suraningsih, Titin Sri Martini, and Tri Atmojo Kusmayadi. "Antimagic covering on double star and related graphs." In PROCEEDINGS OF THE 7TH SEAMS UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2015: Enhancing the Role of Mathematics in Interdisciplinary Research. AIP Publishing LLC, 2016. http://dx.doi.org/10.1063/1.4940818.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!