A new result on chromaticity of K4-homoemorphs with girth 9
Authors
Abstract:
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically unique $K_4$-homeomorphs which have girth 9 and has exactly one path of length 1, and give sufficient and necessary condition for the graphs in this family to be chromatically unique.
similar resources
a new result on chromaticity of k4-homoemorphs with girth 9
for a graph $g$, let $p(g,lambda)$ denote the chromatic polynomial of $g$. two graphs $g$ and $h$ are chromatically equivalent if they share the same chromatic polynomial. a graph $g$ is chromatically unique if any graph chromatically equivalent to $g$ is isomorphic to $g$. a $k_4$-homeomorph is a subdivision of the complete graph $k_4$. in this paper, we determine a family of chromatically uni...
full textThe coloring game on planar graphs with large girth, by a result on sparse cactuses
We denote by χg(G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang. Decomposing a planar gr...
full textA trivalent graph with 58 vertices and girth 9
A regular graph with valency k and girth g will be referred to as a (/,. ~.,, ,:_';~,~,+ Petersen 's graph is a (3, 5)-graph; indeed, it is the (unique) smallest (3. :,)-, ~,~;+ In general, the problem of finding a smallest (k, g)-graph is hard, an~ ~;-~,~: .~;;.-,~,'~/~ is known only for a few values of k and g. The particular case k = 3 , g = 9 has been the subject of much e~ i~::~..t~r~,...,...
full texton the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولPhosphorus K4 Crystal: A New Stable Allotrope
The intriguing properties of phosphorene motivate scientists to further explore the structures and properties of phosphorus materials. Here, we report a new allotrope named K4 phosphorus composed of three-coordinated phosphorus atoms in non-layered structure which is not only dynamically and mechanically stable, but also possesses thermal stability comparable to that of the orthorhombic black p...
full textBest Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions. We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.
full textMy Resources
Journal title
volume 43 issue 2
pages 319- 336
publication date 2017-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023