Results 21 to 30 of about 732,396 (308)
TOTAL CHROMATIC NUMBER OF FUZZY BISTAR GRAPH & FUZZY HELM GRAPH [PDF]
, 2022 Fuzzy total chromatic number is the least value of k such that k-fuzzy total coloring exist. In this paper, we discussed the concept of total coloring of graphs to Fuzzy bistar graph and Fuzzy helm graph.
A.Marydayana, A.Deebamonica
core +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
On the Total Set Chromatic Number of Graphs
Theory and Applications of Graphs, 2022 Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets.
Mark Anthony C. Tolentino +2 more
doaj +1 more source
On Pathos Total Semitotal and Entire Total Block Graph of a Tree [PDF]
, 2012 In this communication, the concept of pathos total semitotal and entire total block graph of a tree is introduced. Its study is concentrated only on trees.
Syed Babajan +2 more
core +1 more source
On the total and AVD-total coloring of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and e receive different colors. The least number of colors sufficient for a total coloring of graph G is
B. S. Panda, Shaily Verma, Yash Keerti
openaire +2 more sources
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Graphs whose line graphs are ring graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in ...
Mahdi Reza Khorsandi
doaj +1 more source
Wiener index of graphs over rings: a survey
AKCE International Journal of Graphs and Combinatorics, 2022 This article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs.
T. Asir +3 more
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Total Eccentricity Indices Of A Graph [PDF]
, 2021 We have defined and evaluated total eccentricity indices of polyhex nanotubes TUAC6(p, q) and TUZC6(p, q). In thispaper, we compute First Total Eccentricity Index, Second Total Eccentricity Index, First Multiplicative Total Eccentricity Index, Second ...
et. al., M. Bhanumathi,
core +1 more source