Results 41 to 50 of about 57,891 (276)
Edge chromatic index and edge-sum chromatic index for families of integral sum graphs
, 2023 We consider class of integral sum graphs $H^{-i,s}_{m,j}$ subject to the conditions $-i< ...
R, Priyanka B +2 more
openaire +2 more sources
A generalization of chromatic index
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sampathkumar, E., Kamath, G.D.
openaire +1 more source
Zero Divisor Graph Of ZpM qr with Applications [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2020 In this paper, we study zero-divisor graph of the ring Zpmqr and give some properties of this graph. Also, we find the chromatic number, Hosoya polynomial and Wiener index of this graph.
Nazar Shuker +2 more
doaj +1 more source
Oriented Incidence Colourings of Digraphs
Discussiones Mathematicae Graph Theory, 2019 Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
Acyclic chromatic index of fully subdivided graphs and Halin graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Manu Basavaraju
doaj +1 more source
Dispersion and nonlinearity properties of small solid-core photonic fibers with As2Se3 substrate
Tạp chí Khoa học Đại học Huế: Khoa học Tự nhiên, 2021 Characteristics of As2Se3 photonic crystal fibers (PCFs) with a solid-core and small-core diameter are numerically investigated in the long-wavelength range (from 2 to 10 μm).
Thi Thuy Nguyen +4 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Controlled syntheses of lanthanide coordination polymers based on the dihydroxybenzoquinone (DHBQ) organic linker afforded large single crystals of Ln‐DHBQ CPs (Ln = Yb, Nd). A novel structural variant of Yb‐DHBQ is identified by means of single crystal diffraction analysis.
Marina I. Schönherr +7 more
wiley +1 more source
On the $f$-matching polytope and the fractional $f$-chromatic index
, 2014 Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters.
Glock, Stefan
core +1 more source
The strong chromatic index of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe chromatic index $\chi'(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors.
Yiqiao Wang +3 more
doaj +1 more source
Conflict-free chromatic index of trees
Theoretical Computer ScienceA graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable is called the conflict-free chromatic index of $G ...
Shanshan Guo +3 more
openaire +2 more sources