Log in

Relevant bibliographies by topics / Vertex labeled graph

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Vertex labeled graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vertex labeled graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Vertex labeled graph"

1

Zhang, Zhijun, Muhammad Awais Umar, Xiaojun Ren, Basharat Rehman Ali, Mujtaba Hussain, and Xiangmei Li. "Tree-Antimagicness of Web Graphs and Their Disjoint Union." Mathematical Problems in Engineering 2020 (April 9, 2020): 1–6. http://dx.doi.org/10.1155/2020/4565829.

Full text

Abstract:

In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph G=V,E, with vertex set V and edge set E, a function from V to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex-labeled graph. Similarly, an edge labeling is a function of E to a set of labels, and in this case, the graph is called an edge-labeled graph. In this research article, we focused on studying super ad,d-T4,2-antimagic labeling of web graphs W2,n and isomorphic copies of their disj

APA, Harvard, Vancouver, ISO, and other styles

2

Sapunov, Serhii, Aleksei Senchenko, and Oleh Sereda. "Metric properties of the canonical defining pair for determined graphs." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 34 (April 24, 2021): 134–45. http://dx.doi.org/10.37069/10.37069/1683-4720-2020-34-13.

Full text

Abstract:

The aim of this paper is to study the representation of deterministic graphs (D-graphs) by sets of words over the vertex labels alphabet and to find metric properties of this representation. Vertex-labeled graphs are widely used in various computational processes modeling in programming, robotics, model checking, etc. In such models graphs playing the role of an information environment of single or several mobile agents. Walks of agents on a graph determines the sequence of vertices labels or words in the alphabet of labels. A vertex-labeled graph is said to be D-graph if all vertices in the n

APA, Harvard, Vancouver, ISO, and other styles

3

Guirao, Juan, Sarfraz Ahmad, Muhammad Siddiqui, and Muhammad Ibrahim. "Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph." Mathematics 6, no. 12 (2018): 304. http://dx.doi.org/10.3390/math6120304.

Full text

Abstract:

A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with such a capacity characterized is known as a vertex-labeled graph. Similarly, an edge labeling is an element of E to an arrangement of labels. For this situation, the graph is called an edge-labeled graph. We examine an edge irregular reflexive k-labeling for the disjoint association of the cycle related graphs and decide the correct estimation of the

APA, Harvard, Vancouver, ISO, and other styles

4

Bagheri Gh., Behrooz. "(G1,G2)-permutation graphs." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550051. http://dx.doi.org/10.1142/s1793830915500512.

Full text

Abstract:

Let [Formula: see text] and [Formula: see text] be two labeled graphs of order [Formula: see text]. For any permutation [Formula: see text] the [Formula: see text]-permutation graph of labeled graphs [Formula: see text] and [Formula: see text] is the union of [Formula: see text] and [Formula: see text] together with the edges joining the vertex [Formula: see text] to the vertex [Formula: see text]. This operation on graphs is useful to produce a large class of networks with approximately the same properties as one of the original networks or even smaller. In this work we consider some properti

APA, Harvard, Vancouver, ISO, and other styles

5

Bača, Martin, Nurdin Hinding, Aisha Javed, and Andrea Semaničová-Feňovčíková. "H-Irregularity Strengths of Plane Graphs." Symmetry 13, no. 2 (2021): 229. http://dx.doi.org/10.3390/sym13020229.

Full text

Abstract:

Graph labeling is the mapping of elements of a graph (which can be vertices, edges, faces or a combination) to a set of numbers. The mapping usually produces partial sums (weights) of the labeled elements of the graph, and they often have an asymmetrical distribution. In this paper, we study vertex–face and edge–face labelings of two-connected plane graphs. We introduce two new graph characteristics, namely the vertex–face H-irregularity strength and edge–face H-irregularity strength of plane graphs. Estimations of these characteristics are obtained, and exact values for two families of graphs

APA, Harvard, Vancouver, ISO, and other styles

6

Murugan, A. Nellai, and Shiny Priyanka. "TREE RELATED EXTENDED MEAN CORDIAL GRAPHS." International Journal of Research -GRANTHAALAYAH 3, no. 9 (2015): 143–48. http://dx.doi.org/10.29121/granthaalayah.v3.i9.2015.2954.

Full text

Abstract:

Let G = (V,E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1,2} such that each edge uv is assigned the label where ⌈ x ⌉ is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by almost 1. The graph that admits an Extended Mean Cordial Labeling is called Extended Mean Cordial Graph. In this paper, we proved t

APA, Harvard, Vancouver, ISO, and other styles

7

Kheibari, M., H. Abdollahzadeh Ahangar, R. Khoeilar, and S. M. Sheikholeslami. "Total Roman 2 -Reinforcement of Graphs." Journal of Mathematics 2021 (April 10, 2021): 1–7. http://dx.doi.org/10.1155/2021/5515250.

Full text

Abstract:

A total Roman 2 -dominating function (TR2DF) on a graph Γ = V , E is a function l : V ⟶ 0,1,2 , satisfying the conditions that (i) for every vertex y ∈ V with l y = 0 , either y is adjacent to a vertex labeled 2 under l , or y is adjacent to at least two vertices labeled 1; (ii) the subgraph induced by the set of vertices with positive weight has no isolated vertex. The weight of a TR2DF l is the value ∑ y ∈ V l y . The total Roman 2 -domination number (TR2D-number) of a graph Γ is the minimum weight of a TR2DF on Γ . The total Roman 2 -reinforcement number (TR2R-number) of a graph is the mini

APA, Harvard, Vancouver, ISO, and other styles

8

Rajan, M. A., N. M. Kembhavimath, and V. Lokesha. "On Study of Vertex Labeling of Graph Operations." Journal of Scientific Research 3, no. 2 (2011): 291–301. http://dx.doi.org/10.3329/jsr.v3i2.6222.

Full text

Abstract:

Vertices of the graphs are labeled from the set of natural numbers from 1 to the order of the given graph. Vertex adjacency label set (AVLS) is the set of ordered pair of vertices and its corresponding label of the graph. A notion of vertex adjacency label number (VALN) is introduced in this paper. For each VLS, VLN of graph is the sum of labels of all the adjacent pairs of the vertices of the graph. is the maximum number among all the VALNs of the different labeling of the graph and the corresponding VALS is defined as maximal vertex adjacency label set . In this paper for different graph ope

APA, Harvard, Vancouver, ISO, and other styles

9

Jiang, Huiqin, Pu Wu, Zehui Shao, Yongsheng Rao, and Jia-Bao Liu. "The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2)." Mathematics 6, no. 10 (2018): 206. http://dx.doi.org/10.3390/math6100206.

Full text

Abstract:

A double Roman dominating function (DRDF) f on a given graph G is a mapping from V ( G ) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f ( u ) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 and a vertex u for which f ( u ) = 1 has at least a neighbor labeled 2 or 3. The weight of a DRDF f is the value w ( f ) = ∑ u ∈ V ( G ) f ( u ) . The minimum weight of a DRDF on a graph G is called the double Roman domination number γ d R ( G ) of G. In this paper, we determine the exact value of the double Roman domination number of the generalized Petersen graphs P (

APA, Harvard, Vancouver, ISO, and other styles

10

Akutsu, Tatsuya, Avraham A. Melkman, and Takeyuki Tamura. "Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree." International Journal of Foundations of Computer Science 31, no. 02 (2020): 253–73. http://dx.doi.org/10.1142/s0129054120500069.

Full text

Abstract:

We consider the maximum common connected edge subgraph problem and the maximum common connected induced subgraph problem for simple graphs with labeled vertices (or labeled edges). The former is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs. The latter is to find a common connected induced subgraph with the maximum number of vertices. We prove that both problems are NP-hard for 3-outerplanar labeled graphs even if the maximum vertex degree is bounded by 4. Since the reductions used in the proofs construct graphs with

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Vertex labeled graph"

1

Shafie, Termeh. "Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference." Doctoral thesis, Stockholms universitet, Statistiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82697.

Full text

Abstract:

This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered. The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. The second model is obtained by independent edge assignments (IEA) according to a common probability distribution over the edge sites. Two different methods for obtaining an approximate IEA model from an RSM model are also presented. In Paper I, multigraphs

APA, Harvard, Vancouver, ISO, and other styles

2

Tahraoui, Mohammed Amin. "Coloring, packing and embedding of graphs." Phd thesis, Université Claude Bernard - Lyon I, 2012. http://tel.archives-ouvertes.fr/tel-00995041.

Full text

Abstract:

In this thesis, we investigate some problems in graph theory, namelythe graph coloring problem, the graph packing problem and tree pattern matchingfor XML query processing. The common point between these problems is that theyuse labeled graphs.In the first part, we study a new coloring parameter of graphs called the gapvertex-distinguishing edge coloring. It consists in an edge-coloring of a graph G whichinduces a vertex distinguishing labeling of G such that the label of each vertex isgiven by the difference between the highest and the lowest colors of its adjacentedges. The minimum number of

APA, Harvard, Vancouver, ISO, and other styles

3

Meng, Jinghan. "Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6900.

Full text

Abstract:

In recent years, the popularity of graph databases has grown rapidly. This paper focuses on single-graph as an effective model to represent information and its related graph mining techniques. In frequent pattern mining in a single-graph setting, there are two main problems: support measure and search scheme. In this paper, we propose a novel framework for constructing support measures that brings together existing minimum-image-based and overlap-graph-based support measures. Our framework is built on the concept of occurrence / instance hypergraphs. Based on that, we present two new support m

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Vertex labeled graph"

1

Hermelin, Danny, Avivit Levy, Oren Weimann, and Raphael Yuster. "Distance Oracles for Vertex-Labeled Graphs." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22012-8_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grunsky, Igor, Oleksiy Kurganskyy, and Igor Potapov. "Languages Representable by Vertex-Labeled Graphs." In Mathematical Foundations of Computer Science 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11549345_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Mingfei, Chu Chung Christopher Ma, and Li Ning. "(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38236-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chechik, Shiri. "Improved Distance Oracles and Spanners for Vertex-Labeled Graphs." In Algorithms – ESA 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33090-2_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Laish, Itay, and Shay Mozes. "Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs." In Approximation and Online Algorithms. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mozes, Shay, and Eyal E. Skop. "Efficient Vertex-Label Distance Oracles for Planar Graphs." In Approximation and Online Algorithms. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mohar, Bojan, and Petr Škoda. "On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25011-8_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Benjamin, Arthur, Gary Chartrand, and Ping Zhang. "Constructing Trees." In The Fascinating World of Graph Theory. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691175638.003.0004.

Full text

Abstract:

This chapter considers a class of graphs called trees and their construction. Trees are connected graphs containing no cycles. When dealing with trees, a vertex of degree 1 is called a leaf rather than an end-vertex. The chapter first provides an overview of trees and their leaves, along with the relevant theorems, before discussing a tree-counting problem, introduced by British mathematician Arthur Cayley, involving saturated hydrocarbons. It shows that counting the number of saturated hydrocarbons is the same as counting the number of certain kinds of nonisomorphic trees. It then revisits another Cayley problem, one that involved counting labeled trees, and describes Cayley's Tree Formula and the corresponding proof known as the Prüfer code. It also explores decision trees and concludes by looking at the Minimum Spanning Tree Problem and its solution, Kruskal's Algorithm.

APA, Harvard, Vancouver, ISO, and other styles

9

Li, Guanfeng, and Zongmin Ma. "A Fuzzy RDF Graph-Matching Method Based on Neighborhood Similarity." In Advances in Data Mining and Database Management. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8446-9.ch009.

Full text

Abstract:

With the popularity of fuzzy RDF data, identifying correspondences among these data sources is an important task. Although there are some solutions addressing this problem in classical RDF datasets, existing methods do not consider fuzzy information which is an important property existing in fuzzy RDF graphs. In this article, we apply fuzzy graph to model the fuzzy RDF datasets and propose a novel similarity-oriented RDF graph matching approach, which makes full use of the 1-hop neighbor vertex and edge label information, and takes into account the fuzzy information of a fuzzy RDF graph. Based on the neighborhood similarity, we propose a breadth-first branch-and-bound method for fuzzy RDF graph matching, which uses a state space search method and uses truncation parameters to constrain the search. This algorithm can be used to identify the matched pairs.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Vertex labeled graph"

1

Linhares Pontes, Elvys, Stéphane Huet, Thiago Gouveia da Silva, Andréa carneiro Linhares, and Juan-Manuel Torres-Moreno. "Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming." In Proceedings of the Twelfth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-12). Association for Computational Linguistics, 2018. http://dx.doi.org/10.18653/v1/w18-1704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Weffort-Santos, Celso A., Christiane N. Campos, and Rafael C. S. Schouery. "Proper gap-labellings: on the edge and vertex variants." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6343.

Full text

Abstract:

Given a simple graph G, an ordered pair (π, cπ) is said to be a gap- [k]-edge-labelling (resp. gap-[k]-vertex-labelling) ofG ifπ is an edge-labelling (vertex-labelling) on the set {1, . . . , k}, and cπ is a proper vertex-colouring such that every vertex of degree at least two has its colour induced by the largest difference among the labels of its incident edges (neighbours). The decision problems associated with these labellings are NP-complete for k ≥ 3, and even when k = 2 for some classes of graphs. This thesis presents a study of the computational complexity of these problems, structural

APA, Harvard, Vancouver, ISO, and other styles

3

Arora, Akhil, Mayank Sachan, and Arnab Bhattacharya. "Mining statistically significant connected subgraphs in vertex labeled graphs." In SIGMOD/PODS'14: International Conference on Management of Data. ACM, 2014. http://dx.doi.org/10.1145/2588555.2588574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Byonghwa Oh and Jihoon Yang. "Enhancing label inference algorithms considering vertex importance in graph-based semi-supervised learning." In 2016 23rd International Conference on Pattern Recognition (ICPR). IEEE, 2016. http://dx.doi.org/10.1109/icpr.2016.7899876.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Estrada, Spenser, Emilyn Green, Sogol Jahanbekam, and Sara Behdad. "Design for Flexibility: A Graph Coloring Technique to Study Design Changes in the Tethered Economy World." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22559.

Full text

Abstract:

Abstract Digitization, connected networks, embedded software, and smart devices have resulted in a major paradigm shift in business models. Transformative service-based business models are dominating the market, where advancement in technology has paved the way for offering not only a set of new services but also altering product functionalities and services over time. This paradigm shift calls for new design approaches. Designers should be able to design flexible products and services that can adapt to a wide range of consumer needs over time. To address the need for designing for flexibility

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!