Relevant bibliographies by topics / Subdivision of Star graph

Contents

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

Academic literature on the topic 'Subdivision of Star graph'

Author: Grafiati
Published: 7 June 2025
Last updated: 2 August 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 'Subdivision of 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 "Subdivision of Star graph"

1

K.Sunitha. "Radial Radio Pell Mean Labeling of Subdivision of Graphs." Advances in Nonlinear Variational Inequalities 28, no. 2 (2024): 267–73. http://dx.doi.org/10.52783/anvi.v28.1969.

Full text
Abstract:
A one-one mapping ϕ : V (G) → N for a connected graph G is defined as follows: d(x,y)+⌈(ϕ(x)+2ϕ(y))/2⌉≥1+r(G), where radius is denoted by r(G). Any vertex in G has a radial radio pell mean number of ϕ which is the maximum number and is represented by rrpmn(ϕ). Here, we look at the labeling of various graphs using the radial radio pell mean of subdivisions such as subdivision of star graph S(K_(1,n)) , subdivision of path graph S(Pn) , subdivision of friendship graph S(Fn), subdivision of wheel graph S(Wn), subdivision of quadrilateral book graph S(QB(4,3)), subdivision of closed helm graph S(C
APA, Harvard, Vancouver, ISO, and other styles
2

Sasikala, C. Muthulakshmi @., and A. Akil Nivetha. "Exploring Mean Cordial Labeling Possible Combination Position of Vertices in Graphs: A Computational Approach." Indian Journal Of Science And Technology 17, no. 39 (2024): 4111–18. http://dx.doi.org/10.17485/ijst/v17i39.2915.

Full text
Abstract:
Objectives: We have developed the Python module of mean cordial labeling for the different types of graphs, like Path, Cycle, and Subdivision of Star graphs. We aim to identify the number of combination positions of vertices that satisfy the mean cordial labeling rules. We have found mathematical equations that describe the labeling behavior in these graphs. Methods: In this paper, a Python program was developed to find the mean cordial labeling of the Path, Cycle, and Subdivision of the Star graph. We have obtained the number of combination positions of vertex obeying the mean cordial labelin
APA, Harvard, Vancouver, ISO, and other styles
3

C, Muthulakshmi @Sasikala, and Akil Nivetha A. "Exploring Mean Cordial Labeling Possible Combination Position of Vertices in Graphs: A Computational Approach." Indian Journal of Science and Technology 17, no. 39 (2024): 4111–18. https://doi.org/10.17485/IJST/v17i39.2915.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;We have developed the Python module of mean cordial labeling for the different types of graphs, like Path, Cycle, and Subdivision of Star graphs. We aim to identify the number of combination positions of vertices that satisfy the mean cordial labeling rules. We have found mathematical equations that describe the labeling behavior in these graphs.&nbsp;<strong>Methods:</strong>&nbsp;In this paper, a Python program was developed to find the mean cordial labeling of the Path, Cycle, and Subdivision of the Star graph. We have obtained the number of combin
APA, Harvard, Vancouver, ISO, and other styles
4

P, Sumathi, and Chandravadana N. "Lucas Antimagic Labeling of some Star Related Graphs." Indian Journal of Science and Technology 15, no. 46 (2022): 2542–47. https://doi.org/10.17485/IJST/v15i46.1862.

Full text
Abstract:
Abstract <strong>Objective:</strong>&nbsp;To identify a new family of Lucas antimagic graph.<strong>&nbsp;Methods:</strong>&nbsp;A (p;q) graph G is said to be a Lucas antimagic graph if there exists a bijection f : E(G) ! fL1;L2; Lqg such that the induced injective function f : V(G) ! f1;2; : : :&aring;Lqg given by f (u) = &aring;e2E(u) f (e) are all distinct (where E(u) is the set of edges incident to u).&nbsp;<strong>Findings:</strong>&nbsp;In this paper the Lucas Antimagic Labeling of Subdivision of star, Shadow graph of star, Splitting graph of star, Subdivision of Bistar, Shadow graph of
APA, Harvard, Vancouver, ISO, and other styles
5

R, Charishma, and Nageswari P. "Cordial Labeling of Subdivision of Central Edge of Bistar Graph and Spider Graph." Indian Journal of Science and Technology 16, no. 35 (2023): 2889–93. https://doi.org/10.17485/IJST/v16i35.679.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;To analyse cordial labelling of subdivision of central edge of bistar graph and Spider graph.&nbsp;<strong>Methods:</strong>&nbsp;Cordial labeling is defined as a function g : V (q ) ! f0;1g in which each edge ab is assigned the label jg(a)􀀀g(b)j with the conditions vg(0)􀀀vg(1) 1 and eg(0)􀀀eg(1) 1 1 where v g ( 0 ) and v g ( 1 ) signify the number of vertices with 0&rsquo;s and 1&rsquo;s, similarly eg (0) and eg (1) signify the number of edges with 0&rsquo;s and 1&rsquo;s.&nbsp;<strong>Findings:</strong>&nbsp;In this paper, it is proved that subdivisi
APA, Harvard, Vancouver, ISO, and other styles
6

Amrullah, S. Azmi, H. Soeprianto, M. Turmuzi, and Y. S. Anwar. "The partition dimension of subdivision graph on the star." Journal of Physics: Conference Series 1280 (November 2019): 022037. http://dx.doi.org/10.1088/1742-6596/1280/2/022037.

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

Awais, M. "Antimagic Behavior of S G p n and its Subdivision." Journal of Corrosion and Materials 48, no. 1 (2024): 65–68. http://dx.doi.org/10.61336/jcm2023-7.

Full text
Abstract:
A finite simple graph G with a subgraph H is called a super (b, d)-H-antimagic: if G has an edge covering by subgraphs H1,H2, . . . ,Ht with each Hi∼= H, i = 1, 2, . . . , t, a total labeling α such that wtαH, constitutes an arithmetic progression and α(V (G)) consists of the smallest possible integers. In this manuscript, we investigated the existence of super (b, 1)- star-antimagic labeling of Sun graphs S G p n
APA, Harvard, Vancouver, ISO, and other styles
8

Falcón, Raúl M., M. Venkatachalam, and S. Julie Margaret. "Determining the b-chromatic number of subdivision-vertex neighbourhood coronas." Analele Universitatii "Ovidius" Constanta - Seria Matematica 32, no. 2 (2024): 53–84. https://doi.org/10.2478/auom-2024-0019.

Full text
Abstract:
Abstract Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ K n, where K n is the complete graph of order n. It is also established for those graphs K n ⊡ G having m-degree not greater than n + 2. All the proofs are accompanied by illustrative examples.
APA, Harvard, Vancouver, ISO, and other styles
9

Kanwal, Salma, Ayesha Riasat, Mariam Imtiaz, Zurdat Iftikhar, Sana Javed, and Rehana Ashraf. "Bounds of Strong EMT Strength for certain Subdivision of Star and Bistar." Open Mathematics 16, no. 1 (2018): 1313–25. http://dx.doi.org/10.1515/math-2018-0111.

Full text
Abstract:
AbstractA super edge-magic total (SEMT) labeling of a graph ℘(V, E) is a one-one map ϒ from V(℘)∪E(℘) onto {1, 2,…,|V (℘)∪E(℘) |} such that ∃ a constant “a” satisfying ϒ(υ) + ϒ(υν) + ϒ(ν) = a, for each edge υν ∈E(℘), moreover all vertices must receive the smallest labels. The super edge-magic total (SEMT) strength, sm(℘), of a graph ℘ is the minimum of all magic constants a(ϒ), where the minimum runs over all the SEMT labelings of ℘. This minimum is defined only if the graph has at least one such SEMT labeling. Furthermore, the super edge-magic total (SEMT) deficiency for a graph ℘, signified
APA, Harvard, Vancouver, ISO, and other styles
10

Qiang, Xiaoli, Saeed Kosari, Zehui Shao, Seyed Mahmoud Sheikholeslami, Mustapha Chellali, and Hossein Karami. "A Note on the Paired-Domination Subdivision Number of Trees." Mathematics 9, no. 2 (2021): 181. http://dx.doi.org/10.3390/math9020181.

Full text
Abstract:
For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star), then sdγpr(T)≤min{γpr(T)2+1,n2}, improving the (n−1)-upper bound that was recently proven.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Subdivision of Star graph"

1

Jackson, Penelope S. "Star sets and related aspects of algebraic graph theory." Thesis, University of Stirling, 1999. http://hdl.handle.net/1893/26690.

Full text
Abstract:
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a subset of V(G) such that [x] = k and μ is not an eigenvalue of G - X. It is always the case that the vertex set of G can be partitioned into star sets corresponding to the distinct eigenvalues of G. Such a partition is called a star partition. We give some examples of star partitions and investigate the dominating properties of the set V (G) \ X when μ ε {-I, a}. The induced subgraph H = G - X is called a star complement for μ in G. The Reconstruction Theorem states that for a given eigenvalue μ
APA, Harvard, Vancouver, ISO, and other styles
2

Kosebinu, Kazeem A. "Partially Oriented 6-star Decomposition of Some Complete Mixed Graphs." Digital Commons @ East Tennessee State University, 2021. https://dc.etsu.edu/etd/3943.

Full text
Abstract:
Let $M_v$ denotes a complete mixed graph on $v$ vertices, and let $S_6^i$ denotes the partial orientation of the 6-star with twice as many arcs as edges. In this work, we state and prove the necessary and sufficient conditions for the existence of $\lambda$-fold decomposition of a complete mixed graph into $S_6^i$ for $i\in\{1,2,3,4\}$. We used the difference method for our proof in some cases. We also give some general sufficient conditions for the existence of $S_6^i$-decomposition of the complete bipartite mixed graph for $i\in\{1,2,3,4\}$. Finally, this work introduces the decomposition of
APA, Harvard, Vancouver, ISO, and other styles
3

Anzur, Matthew Paul. "k-star decomposition of lambda-fold complete multipartite graphs." Auburn, Ala., 2007. http://repo.lib.auburn.edu/07M%20Dissertations/ANZUR_MATTHEW_39.pdf.

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

Melinder, Victor. "Upper bounds on the star chromatic index for bipartite graphs." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-164938.

Full text
Abstract:
An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this thesis we consider star edge colouring, which is a variant of proper edge colouring where we additionally require the graph to have no two-coloured paths or cycles with length 4. The smallest number of colours needed to colour a graph G with a star edge colouring is called the star chromatic index of G and is denoted <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cchi'_%7Bst%7D(G)" />. This paper proves an upper bound of the star chromatic i
APA, Harvard, Vancouver, ISO, and other styles
5

Coutinho, Bruno Gabriel Coelho. "Kuramoto model aplicado a um star graph e a redes scale-free." Master's thesis, Universidade de Aveiro, 2011. http://hdl.handle.net/10773/9669.

Full text
Abstract:
Mestrado em Física<br>O trabalho realizado teve como objetivo tentar compreender o efeito de hubs no Kuramoto model, para tal foram analisados dois sistemas diferentes. No primeiro, o Kuramoto model foi aplicado a um hub isolado, revelando-se que, para as distribuições analisadas, a frequência natural do oscilador central desempenha um papel decisivo no comportamento do sistema. Se a diferença entre esta frequência e o valor médio das frequências naturais dos vizinhos do oscilador central for menor que um certo valor, não existe transição de fase no sistema. No entanto, se a diferença
APA, Harvard, Vancouver, ISO, and other styles
6

Tarhini, Batoul. "Oriented paths in digraphs and the S-packing coloring of subcubic graph." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCK079.

Full text
Abstract:
Cette thèse de doctorat est divisée en deux parties principales: La partie I explore l'existence de chemins orientés dans les digraphes, cherchant à établir un lien entre le nombre chromatique d'un digraphe et l'existence de chemins orientés spécifiques en tant que sous-digraphes. Les digraphes contenus dans n'importe quel digraphe n-chromatique sont appelés n-universels. Nous examinons deux conjectures : la conjecture de Burr, qui affirme que chaque arbre orienté d'ordre n est (2n-2)-universel, et la conjecture d'El Sahili, qui déclare que chaque chemin orienté d'ordre n est n-universel. Pour
APA, Harvard, Vancouver, ISO, and other styles
7

Derakhshan, Parisa. "Automorphisms generating disjoint Hamilton cycles in star graphs." Thesis, Loughborough University, 2015. https://dspace.lboro.ac.uk/2134/16779.

Full text
Abstract:
In the first part of the thesis we define an automorphism φn for each star graph Stn of degree n-1, which yields permutations of labels for the edges of Stn taken from the set of integers {1,..., [n/2c]}. By decomposing these permutations into permutation cycles, we are able to identify edge-disjoint Hamilton cycles that are automorphic images of a known two-labelled Hamilton cycle H1 2(n) in Stn. The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconnection network topologies in computer science. All our results improve on the known bounds for numb
APA, Harvard, Vancouver, ISO, and other styles
8

Culver, Chance. "Decompositions of the Complete Mixed Graph by Mixed Stars." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/etd/3782.

Full text
Abstract:
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the c
APA, Harvard, Vancouver, ISO, and other styles
9

Culver, Chance. "Decompositions of the Complete Mixed Graph by Mixed Stars." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/3782.

Full text
Abstract:
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the c
APA, Harvard, Vancouver, ISO, and other styles
10

Moura, Phablo Fernando Soares. "Graph colorings and digraph subdivisions." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/.

Full text
Abstract:
The vertex coloring problem is a classic problem in graph theory that asks for a partition of the vertex set into a minimum number of stable sets. This thesis presents our studies on three vertex (re)coloring problems on graphs and on a problem related to a long-standing conjecture on subdivision of digraphs. Firstly, we address the convex recoloring problem in which an arbitrarily colored graph G is given and one wishes to find a minimum weight recoloring such that each color class induces a connected subgraph of G. We show inapproximability results, introduce an integer linear programming (I
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Subdivision of Star graph"

1

Litvinov, G. L. (Grigoriĭ Lazarevich), 1944- editor of compilation and Sergeev, S. N., 1981- editor of compilation, eds. Tropical and idempotent mathematics and applications: International Workshop on Tropical and Idempotent Mathematics, August 26-31, 2012, Independent University, Moscow, Russia. American Mathematical Society, 2014.

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

Books, Bonnie. Graph Paper: Wish upon a Star. Independently Published, 2019.

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

Mr Star Graph Paper: The Best for Math and Study. Independently Published, 2021.

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

Math Book: Star Animals Math Book Graph Paper 6x9 A5. Independently Published, 2021.

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

House, Booksy. Graph Paper 5x5: 5 Billion Star Hotel Americas National Parks. Independently Published, 2021.

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

Math Book: Star Animals Math Book Graph Paper 8. 5x11 A4. Independently Published, 2021.

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

Publishing, Pexfri. Astronaut Future Star Space Shuttle: Graph Paper 1 Cm with 120 Pages. Independently Published, 2020.

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

Unicorn Moon Star Rainbow Colorful Flower: Graph Paper 1 Cm with 120 Pages. Independently Published, 2020.

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

Publishing, Pexfri. Space Unicorn Star Moon Rainbow Astronaut Cosmos: Graph Paper 1 Cm with 120 Pages. Independently Published, 2020.

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

Publishing, Pexfri. Unicorn Star Rainbow Pony Horse Colorful Fantasy: Graph Paper 1 Cm with 120 Pages. Independently Published, 2020.

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

Book chapters on the topic "Subdivision of Star graph"

1

Kaufmann, Michael, Marc van Kreveld, and Bettina Speckmann. "Subdivision Drawings of Hypergraphs." In Graph Drawing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00219-9_39.

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

Hossain, M. Z., M. A. Wahid, Mahady Hasan, and M. Ashraful Amin. "Spatial Subdivision of Gabriel Graph." In Advances in Swarm and Computational Intelligence. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20469-7_34.

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

Matrasulov, Davron, Jambul Yusupov, Karimjon Sabirov, and Zarif Sabirov. "Breathing Star Graph." In NATO Science for Peace and Security Series B: Physics and Biophysics. Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-007-6618-1_12.

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

Kottarathil, Jomon, Sudev Naduvath, and Joseph Varghese Kureethara. "Star Decompositions." In Graph Theory and Decomposition. Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003391678-7.

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

Smith, Colin, Przemyslaw Prusinkiewicz, and Faramarz Samavati. "Local Specification of Surface Subdivision Algorithms." In Applications of Graph Transformations with Industrial Relevance. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25959-6_23.

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

Shary, Sergey P. "Graph Subdivision Methods in Interval Global Optimization." In Constraint Programming and Decision Making. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04280-0_18.

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

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
8

Fertin, Guillaume, André Raspaud, and Bruce Reed. "On Star Coloring of Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45477-2_14.

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

Fazeli, M., H. Sarbazi-Azad, and R. Farivar. "Parallel Clustering on the Star Graph." In Distributed and Parallel Computing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_32.

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

Gervacio, Severino V. "Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs." In Combinatorial Geometry and Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30540-8_10.

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

Conference papers on the topic "Subdivision of Star graph"

1

Hepburn-Dickins, Floyd, Mark W. Jones, Mike Edwards, Jay Paul Morgan, and Steve Bell. "SIGNN – Star Identification Using Graph Neural Networks." In 2025 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). IEEE, 2025. https://doi.org/10.1109/wacv61041.2025.00878.

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

Yang, Jun, Tao Zhang, Jing-Yan Song, and Hai-Long Zhu. "A New Sub-Pixel Subdivision Location Algorithm for Star Image." In 2009 2nd International Congress on Image and Signal Processing (CISP). IEEE, 2009. http://dx.doi.org/10.1109/cisp.2009.5301206.

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

Amrullah, Edy Tri Baskoro, Saladin Uttunggadewa, and Rinovia Simanjuntak. "The partition dimension of subdivision of a graph." 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.4940802.

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

Yang, Liu, Miao Li, and Xinpu Deng. "Fast Matching Algorithm for Sparse Star Points Based on Improved Delaunay Subdivision." In 2021 2nd International Symposium on Computer Engineering and Intelligent Communications (ISCEIC). IEEE, 2021. http://dx.doi.org/10.1109/isceic53685.2021.00031.

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

Wu, Xiaolong, Min He, Fei Wang, Jing Yang, and Shahram Latifi. "Distinct Paths for the Star Graph." In 2009 WRI International Conference on Communications and Mobile Computing (CMC). IEEE, 2009. http://dx.doi.org/10.1109/cmc.2009.294.

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

Mancini, F. P., P. Sodano, and A. Trombettoni. "BEC in a star-comb graph." In LECTURES ON THE PHYSICS OF STRONGLY CORRELATED SYSTEMS XI: Eleventh Training Course in the Physics of Strongly Correlated Systems. AIP, 2007. http://dx.doi.org/10.1063/1.2751999.

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

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
8

Bangay, Shaun, and Chantelle Morkel. "Graph matching with subdivision surfaces for texture synthesis on surfaces." In the 4th international conference. ACM Press, 2006. http://dx.doi.org/10.1145/1108590.1108601.

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

Meena, S., G. Gajalakshmi, and P. Kavitha. "Prime labeling of h-super subdivision of cycle related graph." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0109588.

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

Shainy, V. Shendra, and V. Balaji. "Relaxed mean labeling for three star graph." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0017339.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Subdivision of Star graph' for particular source types:
Journal articles Dissertations / Theses Books
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