Log in

Relevant bibliographies by topics / Labeled graphs / Journal articles

To see the other types of publications on this topic, follow the link: Labeled graphs.

Journal articles on the topic 'Labeled graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Labeled graphs.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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

2

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

3

MATSUMOTO, KENGO. "FACTOR MAPS OF LAMBDA-GRAPH SYSTEMS AND INCLUSIONS OF C*-ALGEBRAS." International Journal of Mathematics 15, no. 04 (2004): 313–39. http://dx.doi.org/10.1142/s0129167x04002351.

Full text

Abstract:

A λ-graph system is a labeled Bratteli diagram with shift transformation. It is a generalization of finite labeled graphs and presents a subshift. In [Doc. Math. 7 (2002), 1–30], the author introduced a C*-algebra [Formula: see text] associated with a λ-graph system [Formula: see text] as a generalization of the Cuntz–Krieger algebras. In this paper, we study a functorial property between factor maps of λ-graph systems and inclusions of the associated C*-algebras with gauge actions. We prove that if there exists a surjective left-covering λ-graph system homomorphism [Formula: see text], there

APA, Harvard, Vancouver, ISO, and other styles

4

Dutta, Tridib, Lenwood S. Heath, V. S. Anil Kumar, and Madhav V. Marathe. "Labeled cuts in graphs." Theoretical Computer Science 648 (October 2016): 34–39. http://dx.doi.org/10.1016/j.tcs.2016.07.040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Joglekar, Manas, Nisarg Shah, and Ajit A. Diwan. "Balanced group-labeled graphs." Discrete Mathematics 312, no. 9 (2012): 1542–49. http://dx.doi.org/10.1016/j.disc.2011.09.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

7

Ishii, Atsushi. "The Markov theorems for spatial graphs and handlebody-knots with Y-orientations." International Journal of Mathematics 26, no. 14 (2015): 1550116. http://dx.doi.org/10.1142/s0129167x15501165.

Full text

Abstract:

We establish the Markov theorems for spatial graphs and handlebody-knots. We introduce an IH-labeled spatial trivalent graph and develop a theory on it, since both a spatial graph and a handlebody-knot can be realized as the IH-equivalence classes of IH-labeled spatial trivalent graphs. We show that any two orientations of a graph without sources and sinks are related by finite sequence of local orientation changes preserving the condition that the graph has no sources and no sinks. This leads us to define two kinds of orientations for IH-labeled spatial trivalent graphs, which fit a closed br

APA, Harvard, Vancouver, ISO, and other styles

8

Sun, Liang, Yuzhu Zhou, Xuan Chen, and Chuanyu Wu. "Type Synthesis and Application of Gear Linkage Transplanting Mechanisms Based on Graph Theory." Transactions of the ASABE 62, no. 2 (2019): 515–28. http://dx.doi.org/10.13031/trans.13200.

Full text

Abstract:

Abstract. Type synthesis is an important step when designing innovations in mechanisms. To overcome the limitation of traditional gear train transplanting mechanisms in realizing a specific trajectory, a swinging linkage mechanism is introduced into the design of the transplanting mechanism. To design a crop-transplanting gear linkage mechanism (GLM), an automatic synthesis method based on graph theory is proposed in this article. First, the numbers of loops, links, joints and other parameters, along with unlabeled graphs, are calculated based on the structural characteristics of the GLM. The

APA, Harvard, Vancouver, ISO, and other styles

9

Harlander, Jens, and Stephan Rosebrock. "Aspherical word labeled oriented graphs and cyclically presented groups." Journal of Knot Theory and Its Ramifications 24, no. 05 (2015): 1550025. http://dx.doi.org/10.1142/s021821651550025x.

Full text

Abstract:

A word labeled oriented graph (WLOG) is an oriented graph [Formula: see text] on vertices X = {x1,…,xn}, where each oriented edge is labeled by a word in X±1. WLOGs give rise to presentations which generalize Wirtinger presentations of knots. WLOG presentations, where the underlying graph is a tree, are of central importance in view of Whitehead's Asphericity Conjecture. We present a class of aspherical word labeled oriented graphs. This class can be used to produce highly non-injective aspherical labeled oriented trees and also aspherical cyclically presented groups.

APA, Harvard, Vancouver, ISO, and other styles

10

Hellmuth, Marc. "Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees." Discrete Applied Mathematics 267 (August 2019): 1–11. http://dx.doi.org/10.1016/j.dam.2019.06.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

12

Jassim, W. S. "Incidence Matrices of X-Labled Graphs and an Application." Sultan Qaboos University Journal for Science [SQUJS] 14 (June 1, 2009): 61. http://dx.doi.org/10.24200/squjs.vol14iss0pp61-69.

Full text

Abstract:

In this work, we have made some modifications on the definition of the incidence matrices of a directed graph, to let the incidence matrices to be more confident for X – Labeled graphs. The new incidence matrices are called the incidence matrices of X – Labeled graphs, and we used the new definition to give a computer program for Nickolas`s Algorithm .

APA, Harvard, Vancouver, ISO, and other styles

13

Yamanaka, Katsuhisa, Erik D. Demaine, Takehiro Ito, et al. "Swapping labeled tokens on graphs." Theoretical Computer Science 586 (June 2015): 81–94. http://dx.doi.org/10.1016/j.tcs.2015.01.052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Mossel, Elchanan, and Nathan Ross. "Shotgun Assembly of Labeled Graphs." IEEE Transactions on Network Science and Engineering 6, no. 2 (2019): 145–57. http://dx.doi.org/10.1109/tnse.2017.2776913.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Chae, Gab-Byung, Edgar M. Palmer, and Robert W. Robinson. "Counting labeled general cubic graphs." Discrete Mathematics 307, no. 23 (2007): 2979–92. http://dx.doi.org/10.1016/j.disc.2007.03.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Barbay, Jérémy, Luca Castelli Aleardi, Meng He, and J. Ian Munro. "Succinct Representation of Labeled Graphs." Algorithmica 62, no. 1-2 (2010): 224–57. http://dx.doi.org/10.1007/s00453-010-9452-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Rathinabai, G. P., and G. Jeyakumar. "TOPOLOGICAL INDICES FOR LABELED GRAPHS." Advances in Mathematics: Scientific Journal 10, no. 3 (2021): 1301–9. http://dx.doi.org/10.37418/amsj.10.3.17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Farisa, M., and K. S. Parvathy. "Geodesic convexity in labeled graphs." Malaya Journal of Matematik 9, no. 1 (2021): 735–40. http://dx.doi.org/10.26637/mjm0901/0129.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Gurjar, Dharmendra Kumar, and Auparajita Krishnaa. "LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY." Advances and Applications in Discrete Mathematics 27, no. 2 (2021): 209–32. http://dx.doi.org/10.17654/dm027020209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Siehler, Jacob A. "Xor-Magic Graphs." Recreational Mathematics Magazine 6, no. 11 (2019): 35–44. http://dx.doi.org/10.2478/rmm-2019-0004.

Full text

Abstract:

Abstract A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label at each vertex is equal to the bitwise xor of the labels on the adjacent vertices. We show that there is at least one 3-regular xor-magic graph on 2n vertices for every n ⩾ 2. We classify the 3-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.

APA, Harvard, Vancouver, ISO, and other styles

21

Madhawa, Kaushalya, and Tsuyoshi Murata. "Active Learning for Node Classification: An Evaluation." Entropy 22, no. 10 (2020): 1164. http://dx.doi.org/10.3390/e22101164.

Full text

Abstract:

Current breakthroughs in the field of machine learning are fueled by the deployment of deep neural network models. Deep neural networks models are notorious for their dependence on large amounts of labeled data for training them. Active learning is being used as a solution to train classification models with less labeled instances by selecting only the most informative instances for labeling. This is especially important when the labeled data are scarce or the labeling process is expensive. In this paper, we study the application of active learning on attributed graphs. In this setting, the da

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

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

24

Jeyanthi, P., and D. Ramya. "On Construction of Mean Graphs." Journal of Scientific Research 5, no. 2 (2013): 265–73. http://dx.doi.org/10.3329/jsr.v5i2.11545.

Full text

Abstract:

A graph with p vertices and q edges is called a mean graph if there is an injective function f that maps V(G) to such that for each edge uv, is labeled with if is even and if is odd. Then the resulting edge labels are distinct. In this paper, we prove some general theorems on mean graphs and show that the graphs , Jewel graph , Jelly fish graph and are mean graphs.Keywords: Mean labeling; Mean graph.© 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.doi: http://dx.doi.org/10.3329/jsr.v5i2.11545 J. Sci. Res. 5 (2), 265-273 (2013)

APA, Harvard, Vancouver, ISO, and other styles

25

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

26

Hoogeboom, Hendrik Jan, and Grzegorz Rozenberg. "Diamond Properties of Elementary Net Systems." Fundamenta Informaticae 14, no. 3 (1991): 287–300. http://dx.doi.org/10.3233/fi-1991-14303.

Full text

Abstract:

An elementary net system is the basic system model of net theory. The state space of an elementary net system is formalized through the notion of the case graph, which is an edge-labeled graph with a distinguished initial node. The paper investigates syntactic, i.e., graph theoretic properties of case graphs of elementary net systems. In particular it studies the structure of isomorphisms between case graphs.

APA, Harvard, Vancouver, ISO, and other styles

27

Sapunov, S. V., and A. S. Senchenko. "Linguistic representation of vertex-labeled graphs." Reports of the National Academy of Sciences of Ukraine 11 (2019): 17–24. http://dx.doi.org/10.15407/dopovidi2019.11.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Bogolyubov, N. M., A. N. Vasil'ev, and Yu M. Pis'mak. "Enumeration of labeled, three-connected graphs." Journal of Soviet Mathematics 34, no. 5 (1986): 1897–99. http://dx.doi.org/10.1007/bf01095097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Michael, A. A. George, and M. Z. Youssef. "On Prime Labeled Self-Complementary Graphs." Journal of Discrete Mathematical Sciences and Cryptography 17, no. 3 (2014): 239–56. http://dx.doi.org/10.1080/09720529.2013.858501.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Bender, Edward A., E. Rodney Canfield, and Brendan D. McKay. "Asymptotic properties of labeled connected graphs." Random Structures & Algorithms 3, no. 2 (1992): 183–202. http://dx.doi.org/10.1002/rsa.3240030208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Voblyi, V. A., and A. K. Meleshko. "Enumeration of labeled block-cactus graphs." Journal of Applied and Industrial Mathematics 8, no. 3 (2014): 422–27. http://dx.doi.org/10.1134/s1990478914030156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Voblyi, V. A. "Enumeration of labeled geodetic planar graphs." Mathematical Notes 97, no. 3-4 (2015): 321–25. http://dx.doi.org/10.1134/s0001434615030025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ikeshita, Rintaro, and Shin-ichi Tanigawa. "Count Matroids of Group-Labeled Graphs." Combinatorica 38, no. 5 (2017): 1101–27. http://dx.doi.org/10.1007/s00493-016-3469-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Galbrun, Esther, Aristides Gionis, and Nikolaj Tatti. "Overlapping community detection in labeled graphs." Data Mining and Knowledge Discovery 28, no. 5-6 (2014): 1586–610. http://dx.doi.org/10.1007/s10618-014-0373-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Angluin, Dana, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, and Goran Konjevod. "Effective storage capacity of labeled graphs." Information and Computation 234 (February 2014): 44–56. http://dx.doi.org/10.1016/j.ic.2013.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Bataineh, Khaled. "Labeled singular knots." Journal of Knot Theory and Its Ramifications 29, no. 11 (2020): 2050070. http://dx.doi.org/10.1142/s0218216520500704.

Full text

Abstract:

We introduce labeled singular knots and equivalently labeled 4-valent rigid vertex spatial graphs. Labeled singular knots are singular knots with labeled singularities. These knots are considered subject to isotopies preserving the labelings. We provide a topological invariant schema similar to that of Henrich and Kauffman in [A. Henrich and L. H. Kauffman, Tangle insertion invariants for pseudoknots, singular knots, and rigid vertex spatial graphs, Contemp. Math. 689 (2017) 1–10] by inserting rational tangles at the labeled singularities to extend usual knot invariants to our class of singula

APA, Harvard, Vancouver, ISO, and other styles

37

Kalmykov, Georgiy I. "Frame classification of the reduced labeled blocks." Discrete Mathematics and Applications 26, no. 1 (2016): 1–11. http://dx.doi.org/10.1515/dma-2016-0001.

Full text

Abstract:

AbstractWe describe a method of partitioning the given set of graphs into non-intersecting subsets each consisting of graphs with common frame. Sets of graphs having such representations are presented. The possibility to apply these representations to the derivation of asymptotic expansions in some problems of statistical mechanics is discussed.

APA, Harvard, Vancouver, ISO, and other styles

38

Sun, Ke, Zhouchen Lin, and Zhanxing Zhu. "Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labeled Nodes." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 5892–99. http://dx.doi.org/10.1609/aaai.v34i04.6048.

Full text

Abstract:

Graph Convolutional Networks (GCNs) play a crucial role in graph learning tasks, however, learning graph embedding with few supervised signals is still a difficult problem. In this paper, we propose a novel training algorithm for Graph Convolutional Network, called Multi-Stage Self-Supervised (M3S) Training Algorithm, combined with self-supervised learning approach, focusing on improving the generalization performance of GCNs on graphs with few labeled nodes. Firstly, a Multi-Stage Training Framework is provided as the basis of M3S training method. Then we leverage DeepCluster technique, a pop

APA, Harvard, Vancouver, ISO, and other styles

39

Matsumoto, Kengo. "C*-algebras associated with presentations of subshifts ii. ideal structure and lambda-graph subsystems." Journal of the Australian Mathematical Society 81, no. 3 (2006): 369–85. http://dx.doi.org/10.1017/s1446788700014373.

Full text

Abstract:

AbstractA λ-graph system is a labeled Bratteli diagram with shift transformation. It is a generalization of finite labeled graphs and presents a subshift. InDoc. Math.7 (2002) 1–30, the author constructed aC*-algebraO£associated with a λ-graph system £ from a graph theoretic view-point. If a λ-graph system comes from a finite labeled graph, the algebra becomes a Cuntz-Krieger algebra. In this paper, we prove that there is a bijective correspondence between the lattice of all saturated hereditary subsets of £ and the lattice of all ideals of the algebraO£, under a certain condition on £ called

APA, Harvard, Vancouver, ISO, and other styles

40

Moon, Heekyung, Zhanfang Zhao, Jintak Choi, and Sungkook Han. "A novel property graph model for knowledge representation on the Web." International Journal of Engineering & Technology 7, no. 3.33 (2018): 187. http://dx.doi.org/10.14419/ijet.v7i3.33.21010.

Full text

Abstract:

Graphs provide an effective way to represent information and knowledge of real world domains. Resource Description Framework (RDF) model and Labeled Property Graphs (LPG) model are dominant graph data models widely used in Linked Open Data (LOD) and NoSQL databases. Although these graph models have plentiful data modeling capabilities, they reveal some drawbacks to model the complicated structures. This paper proposes a new property graph model called a universal property graph (UPG) that can embrace the capability of both RDF and LPG. This paper explores the core features of UPG and their fun

APA, Harvard, Vancouver, ISO, and other styles

41

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

42

Wamiliana, Wamiliana, Amanto Amanto, Mustofa Usman, Muslim Ansori, and Fadila Cahya Puri. "Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges." Science and Technology Indonesia 5, no. 4 (2020): 131. http://dx.doi.org/10.26554/sti.2020.5.4.131-135.

Full text

Abstract:

A Graph G (V, E) is said to be a connected graph if for every two vertices on the graph there exist at least a path connecting them, otherwise, the graph is disconnected. Two edges or more that connect the same pair of vertices are called parallel edges, and an edge that starts and ends at the same vertex is called a loop. A graph is called simple if it containing no loops nor parallel edges. Given n vertices and m edges, m ≥ 1, there are many graphs that can be formed, either connected or disconnected. In this research, we will discuss how to calculate the number of connected vertices labeled

APA, Harvard, Vancouver, ISO, and other styles

43

Yang, Guowu, William N. N. Hung, Xiaoyu Song, and Wensheng Guo. "A Transformation-Based Approach to Implication of GSTE Assertion Graphs." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/709071.

Full text

Abstract:

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to the model checking ofω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata. In GSTE, properties are specified as assertion graphs, which are labeled directed graphs where each edge is labeled with two labeling functions: antecedent and consequent. In this paper, we show the co

APA, Harvard, Vancouver, ISO, and other styles

44

Barrientos, Christan, та Sarah Minion. "On the number of α-labeled graphs". Discussiones Mathematicae Graph Theory 38, № 1 (2018): 177. http://dx.doi.org/10.7151/dmgt.1985.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Bína, Vladislav, and Jiří Přibil. "Note on enumeration of labeled split graphs." Commentationes Mathematicae Universitatis Carolinae 56, no. 2 (2015): 133–37. http://dx.doi.org/10.14712/1213-7243.2015.112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Bodirsky, Manuel, Clemens Gröpl, and Mihyun Kang. "Generating labeled planar graphs uniformly at random." Theoretical Computer Science 379, no. 3 (2007): 377–86. http://dx.doi.org/10.1016/j.tcs.2007.02.045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Böhme, Thomas, and Bojan Mohar. "Labeled K2, t Minors in Plane Graphs." Journal of Combinatorial Theory, Series B 84, no. 2 (2002): 291–300. http://dx.doi.org/10.1006/jctb.2001.2083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Wolfstahl, Y., and M. Yoeli. "An equivalence theorem for labeled marked graphs." IEEE Transactions on Parallel and Distributed Systems 5, no. 8 (1994): 886–91. http://dx.doi.org/10.1109/71.298217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Brualdi, Richard A., Rosário Fernandes, and Susana Furtado. "On the Bruhat order of labeled graphs." Discrete Applied Mathematics 258 (April 2019): 49–64. http://dx.doi.org/10.1016/j.dam.2018.10.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kozak, Adam, Tomasz Głowacki, and Piotr Formanowicz. "On a generalized model of labeled graphs." Discrete Applied Mathematics 161, no. 13-14 (2013): 1818–27. http://dx.doi.org/10.1016/j.dam.2013.02.019.

Full text

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!