Filters

261,373 Hits in 4.6 sec

### Some inequalities about connected domination number

Cheng Bo, Bolian Liu
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
In this note, 7c, ir, ~',i,/~0, F, IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination  ...  We prove that 7c~<3ir-2 for a connected graph G. Thus, an open problem in discuss further some relations between 7c and 7, [~o,F. IR. respectively.  ...  We are grateful to the referee for many careful revisions and pointing out to us that some ideas in the proof of Theorem 2.4 are similar to those in [2] .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(95)00088-e">doi:10.1016/0012-365x(95)00088-e</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cr2qhrcr3bamdeq6neqdwnv3su">fatcat:cr2qhrcr3bamdeq6neqdwnv3su</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003060501/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/c5d/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDEyMzY1eDk1MDAwODhl.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/3a/b13a6c5c8a6cacfead37b3ba87c6d0871239d656.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(95)00088-e"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

### A note on dominating sets and average distance

Ermelinda DeLaViña, Ryan Pepper, Bill Waller
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
We show that the total domination number of a simple connected graph is greater than the average distance of the graph minus one-half, and that this inequality is best possible.  ...  In addition, we show that the domination number of the graph is greater than two-thirds of the average distance minus one-third, and that this inequality is best possible.  ...  Hence, every spanning tree of G is a trunk for G, and every connected dominating set is the vertex set of some trunk.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2008.03.018">doi:10.1016/j.disc.2008.03.018</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3c477vjcgvfnrgobzqssfz4vqm">fatcat:3c477vjcgvfnrgobzqssfz4vqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190313133703/https://core.ac.uk/download/pdf/81160352.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/8a/448a1112a8dbfa1e4c35418b653c3c61a290406a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2008.03.018"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

### A Study on Connected Domination Transition Number of a Graph

Kaspar S, B. Gayathri, D. Kalpanapriya, M. P. Kulandaivel3
<span title="2018-10-02">2018</span> <i title="Science Publishing Corporation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/piy2nrvrjrfcfoz5nmre6zwa4i" style="color: black;">International Journal of Engineering &amp; Technology</a> </i> &nbsp;
Recently, some researchers attempted on transition of the domination parameter into a connected one.  ...  ., connected domination transition number was introduced and its properties and bounds were studied.  ...  Readers can refer to [6] to know more about the connected domination numbers transition number.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14419/ijet.v7i4.10.20916">doi:10.14419/ijet.v7i4.10.20916</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7bgxutft2vgkhpnogemd562sma">fatcat:7bgxutft2vgkhpnogemd562sma</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200216095758/https://www.sciencepubco.com/index.php/ijet/article/download/20916/9822" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/d9/19d970f9476c7b674c87ab28057a46265addd5df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14419/ijet.v7i4.10.20916"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

### Networks in labor markets: Wage and employment dynamics and inequality

Antoni Calvó-Armengol, Matthew O. Jackson
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sj24t22gfnfprddmjorsfd6flq" style="color: black;">Journal of Economic Theory</a> </i> &nbsp;
We present a model of labor markets that accounts for the social network through which agents hear about jobs.  ...  if E [f ] E [f ] for every nondecreasing function f : R n → R. 15 The domination is strict if strict inequality holds for some nondecreasing f.  ...  Networks We say that i is connected to j if p i (w) = p i (w −j , w j ) for some w and w j .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jet.2005.07.007">doi:10.1016/j.jet.2005.07.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aiwormxqfbehjjiab7u3cvxlta">fatcat:aiwormxqfbehjjiab7u3cvxlta</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809025915/http://macroeconomics-sufe.weebly.com/uploads/1/3/9/2/13929851/calvo_and_jackson_2007_jet.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/cc/31cc5ba6394c6648ee628e1611908f8ba49df3bf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jet.2005.07.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

### The number system hidden inside the Boolean satisfiability problem [article]

Keum-Bae Cho
<span title="2018-01-24">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In addition, I show that 2-SAT does not form the number system and Horn-SAT partially forms the number system according to the feasible value of the dominant variable.  ...  First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler.  ...  However, 2-SAT does not form the number system and Horn-SAT forms the number system only when the feasible value of the dominant variable is '0'. Proof.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.4426v3">arXiv:1406.4426v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3oaz3xp5azfafo2kluc5lwxn2u">fatcat:3oaz3xp5azfafo2kluc5lwxn2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191024064310/https://arxiv.org/pdf/1406.4426v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/87/b587fee6d2d56c26ad95450c9d09e5382af6a744.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.4426v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

### Agent-Based Model Heuristics in Studying Memory Mechanisms

Alexandr A. Ezhov, Svetlana S. Terentyeva
<span title="">2014</span> <i title="Scientific Research Publishing, Inc,"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jxkgrvdwjfbf3iznpywuhrujsu" style="color: black;">Psychology</a> </i> &nbsp;
This study is aimed at proposing an agent-based model formulated in (Ezhov & Khrennikov, 2005) and describing the emergence of specific binary memory codes in the system characterized by high inequality  ...  If we describe the memory of the given agent using the {A, R} or {S, G} codes, we may evidently lose some information about the true history.  ...  More information about the model properties can be revealed not from equilibrium distributions, but from the study of fluctuations, i.e. temporal deviations of agent-in-cell numbers from their equilibrium  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/psych.2014.55048">doi:10.4236/psych.2014.55048</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/spym6oostzebbatejl74yepixm">fatcat:spym6oostzebbatejl74yepixm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140810154641/http://www.scirp.org/journal/PaperDownload.aspx?paperID=45142" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/d1/01d17e08196f4eb3d259b9f081539635445f0c24.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/psych.2014.55048"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

### On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

Elena Fernández, Oscar Meza, Robert Garfinkel, Maruja Ortega
<span title="">2003</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/atonzevfefa2vdbi3do6ad2jda" style="color: black;">Operations Research</a> </i> &nbsp;
Computational results are encouraging, especially in terms of the relatively small number of added inequalities needed to get good lower bounds, and the fact that the vast majority of these have efficient  ...  Dominance Relations and Valid Inequalities An Overview A number of authors have established valid inequalities and dominance relations for RPP.  ...  Dominance Relations Some of the formulations of RPP introduced in the next section are partially based on dominance relations.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.51.2.281.12790">doi:10.1287/opre.51.2.281.12790</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hdy64zeqovfjpmmyxvj4lcsb2i">fatcat:hdy64zeqovfjpmmyxvj4lcsb2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220214245/http://pdfs.semanticscholar.org/288d/6f93a552a90996f9d16cd35f40aeb3fd10cf.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/28/8d/288d6f93a552a90996f9d16cd35f40aeb3fd10cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.51.2.281.12790"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

### Upper bounds on the k-forcing number of a graph [article]

David Amos, Yair Caro, Randy Davila, Ryan Pepper
<span title="2014-01-23">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
These results resolve a problem posed by Meyer about regular bipartite circulant graphs. Finally, we present a relationship between the k-forcing number and the connected k-domination number.  ...  As a corollary, we find that the sum of the zero forcing number and connected domination number is at most the order for connected graphs.  ...  Some of the many other papers written about zero forcing number are: [9, 14, 15, 19, 20, 22, 23, 25] .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.6206v1">arXiv:1401.6206v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qsxz5x7ntvdb7om2tfzetntyoq">fatcat:qsxz5x7ntvdb7om2tfzetntyoq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827223357/https://arxiv.org/pdf/1401.6206v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dc/04/dc04430134e16cce6fade8bbb2243d899f7dfc10.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.6206v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

### Page 7343 of Mathematical Reviews Vol. , Issue 97M [page]

<span title="">1997</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The ar- ticle concludes with some connections to codes, and several open questions.  ...  As applications, we give some structural properties of (k + 1)K>-free graphs, construct all 2K>-free graphs, and count the number of labeled 2K>-free connected bipartite graphs.” 97m:05208 05C70 Miller  ...
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-12_97m/page/7343" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1997-12_97m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

### Introduction to dominated edge chromatic number of a graph [article]

<span title="2020-03-19">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The minimum number of colors among all dominated edge coloring is called the dominated edge chromatic number, denoted by χ_dom^'(G).  ...  Finally, we consider the k-subdivision of G and study the dominated edge chromatic number of these kind of graphs.  ...  Motivated by dominated chromatic number of graphs, we consider the proper edge coloring of G and introduce the dominated edge chromatic number of G, χ ′ dom (G), obtain some properties of χ ′ dom (G) and  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.10232v1">arXiv:2003.10232v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pl6nfh7smbbxrc3n5zrlmb2oey">fatcat:pl6nfh7smbbxrc3n5zrlmb2oey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200327143003/https://arxiv.org/pdf/2003.10232v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.10232v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

### Comparing Graphs of Different Sizes

RUSSELL LYONS
<span title="2017-05-02">2017</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/domxx2wewzae3e2m2ziqaqbyhm" style="color: black;">Combinatorics, probability &amp; computing</a> </i> &nbsp;
Our methods involve inequalities for determinants, for traces of functions of operators, and for entropy.  ...  Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities  ...  I am grateful to Oded Schramm for discussions at the start of this project and to Prasad Tetali for conversations about Section 5.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s096354831700013x">doi:10.1017/s096354831700013x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cyxix2excjbcxhb2ijztv3mvlu">fatcat:cyxix2excjbcxhb2ijztv3mvlu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228203534/http://pdfs.semanticscholar.org/9808/c023064d7bcce811dd1d36d49ab17595b9d6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/98/08/9808c023064d7bcce811dd1d36d49ab17595b9d6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s096354831700013x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

### New Authoritarianism - A Research Note

György Csepeli, Gergő Prazsák
<span title="">2011</span> <i title="Expert Projects"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q5fi7rs3pvhbbf2ximdc3qxngq" style="color: black;">Sociologie Româneasca = Romanian Sociology</a> </i> &nbsp;
Still the averages do not say anything about the existence of some cognitive patterns which determine the attitude towards social dominance measured by the whole of the scale.  ...  , they opted for number 1.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://doaj.org/article/8939a0cc88d24e5091b4691b784167d4">doaj:8939a0cc88d24e5091b4691b784167d4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7jf3hk5x5ebrnrgau3zg6bxxy">fatcat:n7jf3hk5x5ebrnrgau3zg6bxxy</a> </span>

### Game domination number

Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
We determine the game domination number for several classes of graphs and provide general inequalities relating it to other graph parameters.  ...  The game domination number of the graph G, denoted by g(G), is the domination number of the directed graph resulting from this game.  ...  Now, we turn to some sparser graphs that (as expected) have larger game domination numbers. They also show that the game domination number can be much larger than the domination number.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0012-365x(00)00358-7">doi:10.1016/s0012-365x(00)00358-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b7ayobluunac5d77h7lpo4spbm">fatcat:b7ayobluunac5d77h7lpo4spbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004205247/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/e66/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxMjM2NXgwMDAwMzU4Nw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a1/2d/a12d7774784306d97108f0b1ea92ea34e14cba4c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0012-365x(00)00358-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

### Introduction to dominated edge chromatic number of a graph

The minimum number of colors among all dominated edge coloring is called the dominated edge chromatic number, denoted by $$\chi_{dom}^{\prime}(G)$$.  ...  We obtain some properties of $$\chi_{dom}^{\prime}(G)$$ and compute it for specific graphs.  ...  DOMINATED EDGE CHROMATIC NUMBER OF SOME OPERATIONS ON A GRAPH Fig. 7 . 7 The graph G in Theorem 3.1 Fig. 8 .. 3 . 83 The graph G in Theorem 3There is a connected graph G and a vertex v ∈ V (G) which  ...