Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G (vertex labeling) or to edges of G (edge labeling) or both of them. In this paper we study the graceful labeling for the k- uniform hypertree and define a condition for the corresponding tree to be graceful. A k- uniform hypertree is graceful if the minimum difference of vertices’ labels of each edge is distinct and each one is the label of the corresponding edge.
In this paper we will introduce new type of graphs, when vertices of these graphs are appearance like line and edges of these graphs are appearance like tape or ribbon.We introduce types of representation of the new graph by the adjacent and the incidence matrices and we will discuss their transformations
In this paper we will introduce new type of graphs, when vertices of these graphs are appearance like line and edges of these graphs are appearance like tape or ribbon and when this tape has infinity holes we call these graph (net tape graph or net graph). We introduce types of representation of the new graph by the adjacent and the incidence of matrices, and we will discuss their transformations. AMS Subject Classification 2000: 51H10, 57N10.Keywords: Graphs, Transformations Definitions and backgroundAbstract graphs: An abstract graphs G is a diagram consisting of a finite non empty set of the elements, called "vertices" denoted by V(G) together with a set of unordered pairs of these elements, called "edges" denoted by E(G). The set of vertices of the graph G is called "the vertex -set of G " and the list of edges is called "the edge -list of G " [Gibbons, 1995;Giblin, 1977].Adjacency and incidence: let v and w be vertices of a graph. If v and w are joined by an edge e. then v and w are said to be adjacent. Moreover, v and w are said to be incident with e,and e is said to be incident with v and w [Wilson, 1972].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.