Results 11 to 20 of about 231 (206)
Concise proofs for adjacent vertex-distinguishing total colorings
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, You +3 more
openaire +3 more sources
2-Restricted optimal pebbling number [PDF]
Mathematics and Computational SciencesLet G=(V,E) be a simple graph. A pebbling configuration on G is a function f:V→Ν ∪{0} that assigns a non-negative integer number of pebbles to each vertex.
Juma Gul Dehqan +3 more
doaj +1 more source
Adjacent vertex distinguishing total colorings of 2-degenerate graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengke Miao +3 more
openaire +1 more source
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source
On adjacent vertex distinguishing total coloring of quadrilateral snake
JOURNAL OF ADVANCES IN MATHEMATICS, 2017 In this paper, we prove the existence of the adjacent vertex distinguishing total coloringnof quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake and double alternate quadrilateral snake in detail. Also, we present an algorithm to obtain the adjacent vertex distinguishing total coloring of these quadrilateral graph family ...
K Thirusangu, R Ezhilarasi
openaire +2 more sources
ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE
Taiwanese Journal of Mathematics, 2008 An adjacent vertex distinguishing total coloring of a graph $G$ is a proper total coloring of $G$ such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of $G$ is denoted by $\chi''_{a}(G)$.
Wang, Weifan, Wang, Yiqiao
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Creep experiments at 900°C on coarse‐grained steel‐ceramic composites containing recycled magnesia reveal that higher ceramic volume fractions significantly enhance the creep resistance. Detailed EBSD investigations identify subgrain formation in the steel matrix as the dominant deformation mechanism.
Moritz Müller +6 more
wiley +1 more source
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
Advanced Engineering Materials, EarlyView.The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
Adjacent vertex distinguishing total coloring of corona product of graphs
Ars Mathematica ContemporaneaAn adjacent vertex distinguishing total $k$-coloring $f$ of a graph $G$ is a proper total $k$-coloring of $G$ such that no pair of adjacent vertices has the same color sets, where the color set at a vertex $v$, $C^G_f(v)$, is $\{f(v)\} \cup \{f(vu)|u \in V (G), vu \in E(G)\}$. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph $
Furmańczyk, Hanna, Zuazua, Rita
openaire +3 more sources