Log in

Relevant bibliographies by topics / Double star graph

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Double star graph'

Author: Grafiati

Published: 3 June 2025

Last updated: 22 June 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 star 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 "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.

Full text

Abstract:

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> Here, we introduced a new labeling called Arithmetic sequential graceful labeling and we give Arithmetic sequential graceful labeling to some star related graphs. <strong>Keywords:</strong> Star graph; t-star; U-star; Graceful labeling; Double star

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 methods using algorithmic methods, proving their usefulness and effectiveness for the double star graph. Our findings further enhance the theoretical and practical capabilities of various labeling systems by offering insightful information about how to optimize them for bipartite and tree-like graphs.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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. Maximal outerplanar graphs have been widely applied in different fields of research since 1891, where they hold significant importance. This paper aims to provide a comprehensive analysis of the H-isolation number in maximal outerplanar graphs, ι H ( G ) ≤ min { n 2 k + 4 , n + n 2 2 k + 5 , n − n 2 2 k + 2 } , where H ≅ S 1,k+1,k+1.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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, the regular double-star graph and friendship graph classes are chosen. Since the modular irregularity strength of the friendship graph also holds the minimal irregularity strength, then the labeling is also an irregular labeling with the same strength as the modular case.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 double Roman domination number for middle graphs. We established lower and upper bounds and also we characterize the double Roman domination number of middle graphs. Later we calculated numerical value of double Roman domination number of middle graph of path, cycle, star, double star and friendship graphs.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

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!