Relevant bibliographies by topics / 4-star graph

Contents

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

Academic literature on the topic '4-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 '4-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 "4-star graph"

1

E. Esakkiammal, Et al. "Triple Even Star Decomposition of Complete Bipartite Graphs." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 11 (2023): 479–83. http://dx.doi.org/10.17762/ijritcc.v11i11.9917.

Full text
Abstract:
Let G be a finite, connected, undirected graph without loops or multiple edges. A decomposition {G2, G4, . . . , G2k} of G is said to be an even star decomposition if each Gi is a star and |E(Gi)| = i for all i = 2, 4, . . . , 2k. A graph G is said to have Triple Even Star Decomposition (TESD) if G can be decomposed into 3k stars {3S2, 3S4, . . . , 3S2k}. In this paper, we characterize Triple Even Star Decomposition of complete bipartite graphs
 Km,n when m = 2 and m = 3.
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Yiqiao, Juan Liu, Yongtang Shi, and Weifan Wang. "Star Chromatic Index of 1-Planar Graphs." Symmetry 14, no. 6 (2022): 1177. http://dx.doi.org/10.3390/sym14061177.

Full text
Abstract:
Many symmetric properties are well-explored in graph theory, especially in graph coloring, such as symmetric graphs defined by the automorphism groups, symmetric drawing of planar graphs, and symmetric functions which are used to count the number of specific colorings of a graph. This paper is devoted to studying the star edge coloring of 1-planar graphs. The star chromatic index χst′(G) of a graph G is defined as the smallest k for which the edges of G can be colored by using k colors so that no two adjacent edges get the same color and no bichromatic paths or cycles of length four are produc
APA, Harvard, Vancouver, ISO, and other styles
3

Daming, Ahmad Syukur, and Yuliani Yuliani. "Dimensi Partisi Graf Hasil Amalgamasi Sisi Graf Roda dengan Graf Bintang." Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi 12, no. 2 (2024): 139–44. https://doi.org/10.37905/euler.v12i2.27683.

Full text
Abstract:
This study discusses the analysis of the partition dimension of the graph resulting from the edge amalgamation between the wheel graph ( Wn) and the star graph ( Sm), where the partition dimension is an important parameter in graph theory that serves to measure the minimum number of partitions required to distinguish every pair of vertices through a set of supporting vertices. The amalgamation process is carried out by merging one edge of the wheel graph with one edge of the star graph, thus forming a new graph. This research employs theoretical and algorithmic approaches to calculate the part
APA, Harvard, Vancouver, ISO, and other styles
4

Alivia, Alivia, Kartika Yulianti, and Yaya S. Kusumah. "The Chromatic Number of the Edge Corona Operation of Cycle Graph and Star Graph." Jurnal Matematika, Statistika dan Komputasi 21, no. 2 (2025): 431–38. https://doi.org/10.20956/j.v21i2.37361.

Full text
Abstract:
One of the concepts in graph theory that can be analyzed is chromatic numbers of a graph and operation of two graphs. There are various kinds of operations of two graphs, one of which is the corona edge operation. This research aims to determine the chromatic number of the edge corona operation of graph Cn*K1,m and K1,m*Cn, where Cn is a cycle graph and K1,m is a star graph. The chromatic number is determined based on the pattern formed from several n and m values. The results of this research show that the chromatic number of the edge corona operation of graph Cn*K1,m is 4 for n= 3, 4, ... k
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Mengya, and Wensong Lin. "On star family packing of graphs." RAIRO - Operations Research 55, no. 4 (2021): 2129–40. http://dx.doi.org/10.1051/ro/2021096.

Full text
Abstract:
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs of G such that each Gj is isomorphic to some element of ℋ. An ℋ-packing of a graph G that covers the maximum number of vertices of G is called a maximum ℋ-packing of G. The ℋ-packing problem seeks to find a maximum ℋ-packing of a graph. Let i be a positive integer. An i-star is a complete bipartite graph K1,i. This paper investigates the ℋ-packing problem with H being a family of stars. For an arbitrary family 𝒮 of stars, we design a linear-time algorithm for the 𝒮-packing problem in trees. Let
APA, Harvard, Vancouver, ISO, and other styles
6

Shindy Sagita Br Ginting and Mulyono Mulyono. "Bilangan Kromatik Dari Graf Hasil Operasi Korona Pada Graf Bintang Dan Graf Ligkaran." JURNAL RISET RUMPUN MATEMATIKA DAN ILMU PENGETAHUAN ALAM 2, no. 2 (2023): 263–69. http://dx.doi.org/10.55606/jurrimipa.v2i2.1622.

Full text
Abstract:
Two graphs are operated with various operations, one of which is Operation Corona. The graphs that are operated in this paper are circle graphs and star graphs. Both graphs are operated with Operation Corona. The graph resulting from the operation is then colored using the Greedy Algorithm. The Chromatic Number obtained from the results of the Corona Operation on a graph (Cn ⊙ Sm) is χC_n⊙S_m = 3 for every m,n ≥ 3, {m,n ∈ N}. Because the graph resulting from the corona operation is non-commutative, the chromatic number obtained from the graph (Cn ⊙ Sm) is different from the graph (Sm ⊙ Cn). Th
APA, Harvard, Vancouver, ISO, and other styles
7

Dr., D. Angel Jovanna. "Relaxed Skolem Mean Labeling of 4 - Star Graph with Partition (3,1)." International Journal of Mathematics and Computer Research 13, no. 04 (2025): 5084–86. https://doi.org/10.5281/zenodo.15233852.

Full text
Abstract:
To prove that the 4 - star graph &nbsp;where &nbsp;is a relaxed skolem mean graph if&nbsp; ꞵ - &alpha;<sub>1 &ndash;&nbsp;</sub>&alpha;<sub>2 &ndash;&nbsp;</sub>&alpha;<sub>3 =&nbsp;</sub>6 is the core objective of this article.
APA, Harvard, Vancouver, ISO, and other styles
8

Chudamani. R, Mudda Ramesh, Raghupatruni Sunil Kumar, V. B. V. N. Prasad,. "Product of Semi – Lattices of Certain Graphs." Communications on Applied Nonlinear Analysis 31, no. 1 (2024): 231–37. http://dx.doi.org/10.52783/cana.v31.408.

Full text
Abstract:
Introduction: In this article, author tries to construct a relation between graphs of product of meet-semilattices L = L_1 X L_2, where L_1 and L_2 are two semilattices and obtain some properties of such graphs. Author investigated that for meet-semilattices L_1 and L_2 has a cycle of length n-1 and n.&#x0D; Objectives: author reveals that if L_1 and L_2 be two meet-semilattices with 0 and L = L_1 X L_2, then it is a star graph. In this paper, we have covered some definitions, examples and theorems on zero devisor graph edge of a 4 - cycles or a 5 - cycles. Γ(L) is a star graph.&#x0D; Methods:
APA, Harvard, Vancouver, ISO, and other styles
9

LIN, CHENG-KUAN, JIMMY J. M. TAN, LIH-HSING HSU, EDDIE CHENG, and LÁSZLÓ LIPTÁK. "CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL." Journal of Interconnection Networks 09, no. 01n02 (2008): 83–97. http://dx.doi.org/10.1142/s0219265908002175.

Full text
Abstract:
The diagnosis of faulty processors plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Zheng et al. showed that the diagnosability of the n-dimensional star graph Sn is n - 1. Lai et al. introduced a restricted diagnosability of multiprocessor systems called conditional diagnosability. They consider the situation when no faulty set can contain all the neighbors of any vertex in the system. In this paper, we study the conditional diagnosability of Cayley graphs generated by transposition trees (which inc
APA, Harvard, Vancouver, ISO, and other styles
10

Lau, G. C., and Y. H. Peng. "Chromaticity of complete 4-partite graphs with certain star or matching deleted." Applicable Analysis and Discrete Mathematics 4, no. 2 (2010): 253–68. http://dx.doi.org/10.2298/aadm100512023l.

Full text
Abstract:
Let P(G,?) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ~ H, if P(G,?) = P(H,?). We write [G] = {H |H ~ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 4-partite graphs G accordingly to the number of 5-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, we obtain new families of chromatically unique complete 4-partite graphs with certain star or matching deleted.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "4-star graph"

1

Tsai, Ming-Tsong, and 蔡銘聰. "The Optimal Permutation Rouing Method on 4-Star Graphs." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/55511832526454929473.

Full text
Abstract:
碩士<br>國立交通大學<br>資訊科學學系<br>83<br>Decomposited structured network topologies are widely used in the design and implementation for parallel processing environment. A few years ago, Boolean n-cube was more popular because a large number of nodes can be interconnected using a small number of links. Recently, n-Star Graph has been presented and shown that it has two attractive properties: low diameter and degree. In this thesis, we consider a permutation routing problem for 4-star graphs, and pre
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Ming-Feng, and 李明峯. "A study of graph design with 4-cycles and 3-stars." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/fpxvpd.

Full text
Abstract:
博士<br>淡江大學<br>數學學系博士班<br>106<br>Let K_n be the complete graph on n vertices. Let C_k be a cycle of length k and S_k be a star with k edges. If k = 4, then we call C_4 a 4-cycle and S_3 a 3-star. For any positive integer λ, let λG denote the λ-fold multigraph with λ edges between any two adjacent vertices of G. A decomposition of G is a partition of G into edge-disjoint subgraphs (not necessary distinct) of G. If H_1, H_2, …, H_t are edge-disjoint subgraphs of G such that E(G) = E(H_1)∪E(H_2)∪…∪E(H_t) and Σ_(i=1)^t |E(H_i)|=|E(G)| , then we say that H_1, H_2, …, H_t decompose G. Furthermore, G
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "4-star graph"

1

Staff, ETA Cuisenaire. Summer Stars Math Level e Teacher Manual Topic 6, Data Analysis and Probability : Tables and Graphs: Grade 4. hand2mind, 2008.

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

Book chapters on the topic "4-star graph"

1

Xu, Jin. "Construction of Maximal Planar Graphs with the Different Order." In Maximal Planar Graph Theory and the Four-Color Conjecture. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4745-3_5.

Full text
Abstract:
Abstract Chapter 4 introduces the operation of diagonal flip, by which one can transform a pair of maximal planar graphs with the same order into each other. In this chapter, we fucus on the methods of constructing a maximal planar graph from another one with different order; that is, start with a small order maximal planar graph, e.g., tetrahedron, octahedron or icosahedron, one can obtain a maximal planar graph with a give order by a serious of operations. This can be represented as a generating system, denoted by $$&lt;G; \varPhi &gt;$$ &lt; G ; Φ &gt; , where G is the starting graph and $$
APA, Harvard, Vancouver, ISO, and other styles
2

O´Dell, Jenna R., and Todd R. Frauenholtz. "An Unsolved Graph Theory Problem: Comparing Solutions of Grades 4, 6, & 8." In Theory and Practice: An Interface or A Great Divide? WTM-Verlag Münster, 2019. http://dx.doi.org/10.37626/ga9783959871129.0.81.

Full text
Abstract:
This study investigated how students in Grades 4, 6, and 8 reasoned through a non-routine, unsolved problem. The study took place at a K-8 school in the Midwestern United States. Each grade participated in two or three task-based sessions lasting between 45 and 60 minutes with the researchers. During the sessions, students engaged in the Graceful Tree Conjecture where they examined graceful labelling for Star, Path, and Caterpillar Graphs. We examined differences in students’ generalized solutions across the grades and how they were able to provide justifications and state generalizations of a
APA, Harvard, Vancouver, ISO, and other styles
3

Moran, Gadi. "Phase Transition via Cellular Automata." In New Constructions in Cellular Automata. Oxford University Press, 2003. http://dx.doi.org/10.1093/oso/9780195137170.003.0017.

Full text
Abstract:
The dynamics of unit-charged graphs under iterated local majority rule observed in Moran [2] strongly suggested to me a phase-transition phenomenon. In a correspondence with D. Ruelle on this matter in late 1993, he expressed his feelings that the connection was too vague and that temperature was absent in it. This note is a reproduction of my 1993 response, where I try to force my suggestive feelings into a bit more formal frame. A recent work of Yuval Ginosar and Ron Holzman [1], which extends Moran [2], allows us to replace the definition of a solid, given in section 4, by a sharper one, na
APA, Harvard, Vancouver, ISO, and other styles
4

Dadgostari, Faraz, and Mahtab Hosseininia. "Phasing of Traffic Lights in Urban Intersections." In Graph Theory for Operations Research and Management. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2661-4.ch020.

Full text
Abstract:
In this chapter, the phasing of traffic lights in urban intersections is introduced and discussed applying the graph theory concepts. At first section, some concepts such as traffic streams, vehicle or pedestrian flows, and compatible streams or streams which are in conflict, are introduced. Accordingly, from the viewpoint of graph theory, two approaches are introduced for phasing of traffic streams. The first approach uses the concept of conflict graphs, and the second one uses the concepts such as circular chromatic number and star chromatic number of graphs, developing two procedures of pha
APA, Harvard, Vancouver, ISO, and other styles
5

R. Joshi, Jayshree, and Dharamvirsinh Parmar. "Hk CORDIAL LABELING OF PATH, STAR AND CYCLE GRAPHS." In Futuristic Trends in Contemporary Mathematics & Applications Volume 3 Book 3. Iterative International Publisher, Selfypage Developers Pvt Ltd, 2024. http://dx.doi.org/10.58532/v3bfcm3p2ch2.

Full text
Abstract:
In the present work we contemplate a finite graph which is connected and undirected. We refer to a dynamic survey of graph labeling by Gallian (2020) for detailed survey on graph labeling. For all other standard terminology and notations we refer to Gross and Yellen [4]. A labeling of a graph G = (V, E) is a mapping that carries vertices, edges or both to the set of labels (usually to the positive or non-negative integers).
APA, Harvard, Vancouver, ISO, and other styles
6

Sivagami, Arasu, Michael Angelo Kandavalli, and Bhaskarrao Yakkala. "Design and Evaluation of an Automated Monitoring and Control System for Greenhouse Crop Production." In Next-Generation Greenhouses for Food Security. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.97316.

Full text
Abstract:
An embedded system integrated with sensors based on nanomaterial is proposed for closely monitoring and control microclimate parameters 24 hours a day to maximise production over the whole crop growth season by introducing greenhouse for the cultivation of plants or specific plant species. The system will also eliminate errors in human intervention to optimise production of crops. This system consists of sensors and actuators, an Analogue to Digital Converter (ADC) and a Raspberry Pi. The system will determine whether a defined threshold is passed by any climate parameter and systematically ch
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "4-star graph"

1

Yao, Yuhang, and Syed A. Jafar. "The Capacity of 4-Star-Graph PIR." In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206729.

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

Azevedo, Marcelo Moraes de, Shahram Latifi, and Nader Bagherzadeh. "On Packing and Embedding Hypercubes into Star Graphs." In Simpósio de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1994. http://dx.doi.org/10.5753/sbac-pad.1994.21873.

Full text
Abstract:
Packing is a graph simulation technique hy which pk node-disjoint copies of a guest graph G(k) are embedded into a host graph H(n). Many advantages result from this technique as opposed to a simple embedding of G(k) into H(n). The multiple copies of G(k) can execute different instances of any algorithm designed to run in G(k), providing high throughput via an efficient, low-expansion utilization of H(n). Task migration mechanisms between the multiple copies of G(k) also become possible, allowing a proper allocation of the processors of H(n), load balancing and support of fault tolerance. Other
APA, Harvard, Vancouver, ISO, and other styles
3

Sivakumar, A., Dipanjan Mazumdar, and S. Jabez Dhinagar. "Transistor Coil Ignition System for Kick Start Based Small Engines." In Small Engine Technology Conference & Exposition. Society of Automotive Engineers of Japan, 2011. http://dx.doi.org/10.4271/2011-32-0613.

Full text
Abstract:
&lt;div class="section abstract"&gt;&lt;div class="htmlview paragraph"&gt;Two wheeler 4-stroke small Engine with Kick Start requires longer spark duration along with better spark energy in order to burn the lean mixture and to have better Start ability, lower trigger start RPM is also important to enable ease of start. An effective Ignition System needs to be designed for the above purpose. Hence Transistor Controlled Ignition/Inductive Discharge System (TCI/IDI) unit is preferred which gives all the above mentioned requirements.&lt;/div&gt;&lt;div class="htmlview paragraph"&gt;Normally any co
APA, Harvard, Vancouver, ISO, and other styles
4

Toya, Keiko. "Consumer Acceptance for Using Personal Data." In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1002283.

Full text
Abstract:
Research backgroundDigitalization has been accelerating by the COVID-19 pandemic. Some service fields are offered only via the face-to-face selling channel before starting using the remote channel. The proper use of customers' data, such as their lifestyles, preferences, and behavior history, makes these services more valuable for both customers and companies. However, currently the data utilization infrastructure, law and consumers’ knowledge is not established enough.HypothesesThis study aims to clarify the structure of consumer acceptance for their data usage by a survey in the medical fiel
APA, Harvard, Vancouver, ISO, and other styles
5

Волошин, Н. И., В. В. Салухов, В. А. Пугач та ін. "СТЕРОИД-ИНДУЦИРОВАННАЯ ГИПЕРГЛИКЕМИЯ ПРИ ЛЕЧЕНИИ ЭКСПЕРИМЕНТАЛЬНОГО ОСТРОГО ПОВРЕЖДЕНИЯ ЛЕГКИХ". У Сборник тезисов III Конференции по лечению и диагностике сахарного диабета «Фундаментальная и клиническая диабетология в 21 веке: от теории к практике». ФГБУ «НМИЦ эндокринологии» Минздрава России, 2023. http://dx.doi.org/10.14341/diaconfiii25-26.05.23-27.

Full text
Abstract:
ЦЕЛЬ: исследование влияния различных по дозе и длительности (3 и 7 сут) режимов глюкокортикосте-&#x0D; роидной (ГКС) терапии на концентрацию глюкозы венозной крови при экспериментальном липополиса-&#x0D; харид-индуцированном остром повреждении легких (ОПЛ) у крыс.&#x0D; МАТЕРИАЛЫ И МЕТОДЫ: ОПЛ, как экспериментальную модель острого респираторного дистресс-&#x0D; синдрома взрослых, у крыс моделировали посредством интратрахеального ведения липополисахарида&#x0D; клеточной стенки бактерии Salmonella enterica в дозе 20 мг/кг. Крысы-самцы случайным образом были&#x0D; разделены на группы: группу инта
APA, Harvard, Vancouver, ISO, and other styles
6

Momeni, Amir Farid, Robert J. Peterman, B. Terry Beck, Chih-Hang John Wu, and Naga Narendra B. Bodapati. "Effect of Prestressing Wire Indentation Type on the Bond Performance and Flexural Capacity of Pretensioned Concrete Crossties Subjected to Cyclic Loading." In 2016 Joint Rail Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/jrc2016-5761.

Full text
Abstract:
Load tests were conducted on pretensioned concrete prisms cast with 13 different 5.32-mm-diameter prestressing wire types that are used in the manufacture of pretensioned concrete railroad ties worldwide. The tests were specifically designed to evaluate the bond performance of wires with different indentation type under the cyclic loading. The prestressing wires were denoted “WA” through “WM” and indentation types included smooth, spiral, chevron, diamond, 2-dot and 4-dot. Four wires were embedded into each concrete prism, which had a 3.5″ (88.9 mm) × 3.5″ (88.9 mm) square cross section. The w
APA, Harvard, Vancouver, ISO, and other styles
7

Soca, Mirela. "BATTERY INTERNAL RESISTANCE INFLUENCE ON VOLTAGE-BASED BALANCING ALGORITHMS." In eLSE 2021. ADL Romania, 2021. http://dx.doi.org/10.12753/2066-026x-21-118.

Full text
Abstract:
Evolving technologies such as EVs and smart grids require their batteries to be operated safely and cost-effective and a battery management system is always used to achieve that. This study focused on building a passive balancer for four cells connected in series of a battery pack. Two voltage-based algorithms for passive balancing were tested and results were compared. Batteries premature failure can be caused by not making use of their full capacity. Variations in the physical volume, internal impedance and different self-discharge rates of the cells are a cause [2]. Then, as not all the cel
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic '4-star graph' 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