Results 241 to 250 of about 2,253,480 (276)
Some of the next articles are maybe not open access.
Total Graphs and Total Digraphs
2021As investigation of the concept of a line graph has led to many interesting results, it is natural to expect that there has also been meaningful research into variations and generalizations of the subject. In this, the first of several chapters on such topics, instead of just the edges of a given graph becoming the vertices of a new graph, both the ...
Lowell W. Beineke, Jay S. Bagga
openaire +1 more source
2021
In this chapter, we discuss some generalizations of total graphs of commutative rings. Actually, total graphs of commutative rings are generalized through ideals, multiplicatively closed sets, and multiplicative-prime sets. Further, we discuss the concept of total graphs corresponding to modules and commutative semirings.
David F. Anderson +3 more
openaire +1 more source
In this chapter, we discuss some generalizations of total graphs of commutative rings. Actually, total graphs of commutative rings are generalized through ideals, multiplicatively closed sets, and multiplicative-prime sets. Further, we discuss the concept of total graphs corresponding to modules and commutative semirings.
David F. Anderson +3 more
openaire +1 more source
Extreme-Support Total Monophonic Graphs
Bulletin of the Iranian Mathematical Society, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kathiresan Ganesamoorthy +2 more
openaire +2 more sources
Bulletin of the London Mathematical Society, 1989
We prove that the TCC (Total Colouring Conjecture) is true for complete r-partite graphs which extends a result of M. Rosenfeld. We also give an alternate, slightly simpler proof of an earlier result (which says that the TCC is true for graphs having maximum degree 3) obtained independently by M. Rosenfeld and N. Vijayaditya.
openaire +1 more source
We prove that the TCC (Total Colouring Conjecture) is true for complete r-partite graphs which extends a result of M. Rosenfeld. We also give an alternate, slightly simpler proof of an earlier result (which says that the TCC is true for graphs having maximum degree 3) obtained independently by M. Rosenfeld and N. Vijayaditya.
openaire +1 more source
Total i̇rregulari̇ty of fractal graphs
Asian-European Journal of Mathematics, 2021The irregularity of a simple undirected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. The total irregularity of a graph as a new measure of graph irregularity is defined as [Formula: see text].
openaire +2 more sources
Class‐reconstruction of total graphs
Journal of Graph Theory, 1987AbstractIt is shown that given any vertex‐deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done.
Bange, David W. +2 more
openaire +2 more sources
RELATIVITY BETWEEN COMPLETE BIPARTITE GRAPH AND TOTALLY IRREGULAR TOTAL GRAPH
2023The book provides a thorough analysis of the total irregularity strength of the complete bipartite graph K_(m,n) for any positive integer m and n. It establishes the relationship between the complete bipartite graph and the totally irregular total graph and introduces the concept of a totally irregular total k-graph.
D. MANJULADEVI +2 more
openaire +1 more source
Total Colorings of Degenerated Graphs
Combinatorica, 2001A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤s.
Shuji Isobe, Xiao Zhou, Takao Nishizeki
openaire +1 more source
Advances in Mathematics: Scientific Journal, 2020
T. B. Athul, G. Suresh Singh
openaire +1 more source
T. B. Athul, G. Suresh Singh
openaire +1 more source