Results 21 to 30 of about 9,546 (165)
Odd Harmonious Labeling of the Zinnia Flower Graphs
JURNAL ILMIAH SAINS, 2023 An odd harmonious graph is a graph that satisfies the odd harmonious labeling properties. In this study, a new graph class construction is presented, namely zinnia flower graphs and variations of the zinnia flower graphs. The research method used is qualitative and includes several phases, namely data collection, data processing and analysis, and ...
Firmansah, Fery +2 more
openaire +2 more sources
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
Odd harmonious labeling of super subdivisión graphs [PDF]
Proyecciones (Antofagasta), 2019 A graph G(p, q) is said to be odd harmonious if there exists an injection ?: V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function ?∗: E(G) → {1, 3, · · · , 2q − 1} defined by ?∗(uv) = ? (u) + ? (v) is a bijection. In this paper we prove that super subdivision of any cycle Cm with m ≥ 3 ,ladder, cycle Cn for n ≡ 0(mod 4) with K1,m and ...
P. Jeyanthi, S. Philo, M. K. Siddiqui
openaire +2 more sources
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards +4 more
core +3 more sources
Some New Odd Harmonious Graphs
International Journal of Mathematics and Soft Computing, 2011 A graph which admits odd harmonious labeling is called an odd harmonious graph. In this paper we prove that the shadow graphs of path Pn and star K1,n are odd harmonious. Further we prove that the split graphs of path Pn and star K1,n admit odd harmonious labeling.
N. H. Shah, S. K. Vaidya
openaire +1 more source
APPLICATION OF ODD HARMONIOUS LABELLING OF GRAPHS
, 2022 The labelling of discrete structures is an attractive research topic due to its vast range of applications. The current research is looking on strange harmonious labelling. If there exists an onto ff:V(G)→{0,1,2,,2q−1} such that the induced function 𝑓∗:E(G) →{1,3, ,2q−1}defined by f (uv) = f(u) + f(v) is a bijection, the graph G is said to be odd ...
A.Bhavya, K.Selvaraj
openaire +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Major Reference Works, Page 290-301., 2021 International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
John P. Sutter C. Chantler +2 more
wiley +1 more source
Odd harmonious labeling of grid graphs
Proyecciones (Antofagasta), 2019 A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function f* : E(G) → {1, 3, · · · , 2q − 1} defined by f∗ (uv) = f (u) + f (v) is a bijection. In this paper we prove that path union of t copies of Pm×Pn, path union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t ...
P. Jeyanthi, S. Philo, Maged Z. Youssef
openaire +4 more sources
A characterization of consistent marked graphs [PDF]
, 1992 A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle.
Acharya +5 more
core +2 more sources