Relevant bibliographies by topics / Line digraph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Line digraph'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

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 'Line digraph.'

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 "Line digraph"

1

RUAN, LU, SHITOU HAN, DEYING LI, HUNG Q. NGO, and SCOTT C. H. HUANG. "TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS." Journal of Interconnection Networks 05, no. 04 (2004): 475–87. http://dx.doi.org/10.1142/s021926590400126x.

Full text
Abstract:
The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper.
APA, Harvard, Vancouver, ISO, and other styles
2

Begga, Ahmed, Francisco Escolano Ruiz, and Miguel Ángel Lozano. "Edge-Centric Embeddings of Digraphs: Properties and Stability Under Sparsification." Entropy 27, no. 3 (2025): 304. https://doi.org/10.3390/e27030304.

Full text
Abstract:
In this paper, we define and characterize the embedding of edges and higher-order entities in directed graphs (digraphs) and relate these embeddings to those of nodes. Our edge-centric approach consists of the following: (a) Embedding line digraphs (or their iterated versions); (b) Exploiting the rank properties of these embeddings to show that edge/path similarity can be posed as a linear combination of node similarities; (c) Solving scalability issues through digraph sparsification; (d) Evaluating the performance of these embeddings for classification and clustering. We commence by identifyi
APA, Harvard, Vancouver, ISO, and other styles
3

Solovov, A. V., and A. A. Menshikova. "Cognitive modeling of adaptive learning processes." Ontology of Designing 14, no. 2 (2024): 181–95. http://dx.doi.org/10.18287/2223-9537-2024-14-2-181-195.

Full text
Abstract:
An approach to modeling adaptive learning processes using signed and weighted directed graphs (digraphs) is exam-ined. The vertices of the digraphs represent the characteristics of educational activities. The orientation, signs, and weights of the digraph arcs define the mutual influence of these characteristics. The dynamics of adaptive learning are modeled within digraphs using a specific impulse process algorithm. An external disturbance is introduced into a partic-ular vertex of the digraph, and the propagation of this impulse is analyzed, enabling the prediction of values at other vertice
APA, Harvard, Vancouver, ISO, and other styles
4

Prayitno, Muhammad Irfan Arsyad, and Kiki Ariyanti Sugeng. "On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph." Jurnal Matematika UNAND 11, no. 1 (2022): 74. http://dx.doi.org/10.25077/jmu.11.1.74-81.2022.

Full text
Abstract:
In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in finding the connection between the antiadjacency matrix of a digraph and its line digraph. In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Juan, Lin Sun, and Jixiang Meng. "A line digraph of a complete bipartite digraph." Applied Mathematics Letters 22, no. 4 (2009): 544–47. http://dx.doi.org/10.1016/j.aml.2008.04.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Balbuena, C., D. Ferrero, X. Marcote, and I. Pelayo. "Algebraic properties of a digraph and its line digraph." Journal of Interconnection Networks 04, no. 04 (2003): 377–93. http://dx.doi.org/10.1142/s0219265903000933.

Full text
Abstract:
Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. In addition, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows us to relate properties of G and LG, specifically the number of cycles of a given length.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Fuji, and Guoning Lin. "When a digraph and its line digraph are connected and cospectral." Discrete Mathematics 184, no. 1-3 (1998): 289–95. http://dx.doi.org/10.1016/s0012-365x(97)00200-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Galeana-Sánchez, Hortensia, and L. Pastrana Ramirez. "Kernels in edge coloured line digraph." Discussiones Mathematicae Graph Theory 18, no. 1 (1998): 91. http://dx.doi.org/10.7151/dmgt.1066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cao, Feng, Ding-Zhu Du, Shitou Han, Dongsoo Kim, and Ting Yu. "LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY." Taiwanese Journal of Mathematics 3, no. 3 (1999): 281–90. http://dx.doi.org/10.11650/twjm/1500407128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Villar, J. L. "The underlying graph of a line digraph." Discrete Applied Mathematics 37-38 (July 1992): 525–38. http://dx.doi.org/10.1016/0166-218x(92)90156-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Line digraph"

1

Oliveira, Ana Karolinna Maia de. "Subdivisions de digraphes." Thesis, Nice, 2014. http://www.theses.fr/2014NICE4084/document.

Full text
Abstract:
Dans ce travail, nous considérons le problème suivant : étant donné un graphe orienté D, contient-il une subdivision d’un digraphe fixé F ? Nous pensons qu’il existe une dichotomie entre les instances polynomiales et NP-complètes. Nous donnons plusieurs exemples pour les deux cas. En particulier, sauf pour cinq instances, nous sommes capable de classer tous les digraphes d’ordre 4. Alors que toutes les preuves NP-complétude sont faites par réduction de une version du problème 2-linkage en digraphes, nous utilisons différents outils algorithmiques pour prouver la solvabilité en temps polynomial
APA, Harvard, Vancouver, ISO, and other styles
2

Lichiardopol, Nicolas. "Echange total, diffusion et quelques résultats sur les itérés de line-digraphs." Phd thesis, Université de Nice Sophia-Antipolis, 2003. http://tel.archives-ouvertes.fr/tel-00214261.

Full text
Abstract:
Nous nous intéressons à des protocoles de communications globales portant sur les graphes connexes. Dans une première partie, nous considérons le cas de l'échange total. Le Temps Minimum d'Echange Total (T.M.E.T.) est le nombre minimum d'étapes nécessaires pour que tous les sommets reçoivent tous les messages. Nous établissons des nouvelles bornes (inférieures et supérieures) sur le T.M.E.T. Nous déterminons le T.M.E.T des arbres et plus généralement des graphes de degré minimum un. Nous démontrons une conjecture de Bermond, Kodate, Marlin et Perennes sur les points fixes d'une rotation complè
APA, Harvard, Vancouver, ISO, and other styles
3

He, Weihua. "Cycles in graphs and arc colorings in digraphs." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112352.

Full text
Abstract:
Dans cette thèse nous étudions quatre problèmes de théorie des graphes. En particulier,Nous étudions le problème du cycle hamiltonien dans les line graphes, et aussi nous prouvons l’existence de cycles hamiltoniens dans certains sous graphes couvrants d’un line graphe. Notre résultat principal est: Si L(G) est hamiltonien, alors SL(G) est hamiltonien. Grâce à ce résultat nous proposons une conjecture équivalente à des conjectures célèbres. Et nous obtenons deux résultats sur les cycles hamiltoniens disjoints dans les line graphes.Nous considérons alors la bipancyclicité résistante aux pannes d
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Line digraph"

1

Beineke, Lowell W., and Jay S. Bagga. Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Line Graphs and Line Digraphs. Springer International Publishing AG, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sounds Like Reading Book 6: Whose Shoes Would You Choose? a Long Vowel Sounds Book with Consonant Digraphs. Lerner Publishing Group, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Line digraph"

1

Du, Ding-Zhu, Yuh-Dauh Lyuu, and D. Frank Hsu. "Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55121-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Beineke, Lowell W., and Jay S. Bagga. "Iterated Line Digraphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beineke, Lowell W., and Jay S. Bagga. "Fundamentals of Line Digraphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beineke, Lowell W., and Jay S. Bagga. "Characterizations of Line Digraphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beineke, Lowell W., and Jay S. Bagga. "Super Line Graphs and Super Line Digraphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Beineke, Lowell W., and Jay S. Bagga. "Colorability in Line Graphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Beineke, Lowell W., and Jay S. Bagga. "The Krausz Dimension of a Graph." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Beineke, Lowell W., and Jay S. Bagga. "Fundamentals of Line Graphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Beineke, Lowell W., and Jay S. Bagga. "Path Graphs and Path Digraphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Beineke, Lowell W., and Jay S. Bagga. "Traversability in Line Graphs." In Line Graphs and Line Digraphs. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81386-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Line digraph"

1

Zhou, Honglu, Advith Chegu, Samuel S. Sohn, Zuohui Fu, Gerard de Melo, and Mubbasir Kapadia. "Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learning." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/731.

Full text
Abstract:
Digraph Representation Learning aims to learn representations for directed homogeneous graphs (digraphs). Prior work is largely constrained or has poor generalizability across tasks. Most Graph Neural Networks exhibit poor performance on digraphs due to the neglect of modeling neighborhoods and preserving asymmetry. In this paper, we address these notable challenges by leveraging hyperbolic collaborative learning from multi-ordered partitioned neighborhoods and asymmetry-preserving regularizers. Our resulting formalism, Digraph Hyperbolic Networks (D-HYPR), is versatile for multiple tasks incl
APA, Harvard, Vancouver, ISO, and other styles
2

Joshi, Prashant D., D. Frank Hsu, Arunabha Sen, Said Hamdioui, and Koen Bertels. "Tight Bounds in Message Delays Despite Faults in a Class of Line Digraph Networks." In 2017 14th International Symposium on Pervasive Systems, Algorithms and Networks (ISPAN), 2017 11th International Conference on Frontiers of Computer Science and Technology (FCST), & 2017 Third International Symposium of Creative Computing (ISCC). IEEE, 2017. http://dx.doi.org/10.1109/ispan-fcst-iscc.2017.59.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Daszko, Marcia. "Total quality management: tools and techniques." In OSA Annual Meeting. Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.tum1.

Full text
Abstract:
The seven basic tools allow people looking at a problem to display the data graphically. The tools include: Pareto chart, check sheet, cause and effect diagram, histogram, scatter diagram, line graph, and control chart. The seven new management tools focus on how to improve managing and planning: affinity diagram, interrelationship digraph, tree diagram, prioritization matrices, matrix diagram, process decision program chart, and activity network diagram.
APA, Harvard, Vancouver, ISO, and other styles
4

Dev, Nikhil, Gopal Krishan Goyal, Rajesh Attri, and Naresh Kumar. "Graph Theoretic Analysis of Advance Combined Cycle Power Plants Alternatives With Latest Gas Turbines." In ASME 2013 Gas Turbine India Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/gtindia2013-3760.

Full text
Abstract:
In the present work, graph theory and matrix method is used to analyze some of the heat recovery possibilities with the newly available gas turbine engines. The schemes range from dual pressure heat recovery steam generation systems, to triple pressure systems with reheat in supercritical steam conditions. From the developed methodology, result comes out in the form of a number called as index. A real life operating Combined Cycle Power Plant (CCPP) is a very large and complex system. Efficiency of its components and sub-systems are closely intertwined and insuperable without taking the effect
APA, Harvard, Vancouver, ISO, and other styles
5

Franco, Álvaro J. P., and Marcelo E. Vendramin. "Super-colored paths in digraphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16389.

Full text
Abstract:
We work in an Anthropology application where it is desired to enumerate colored rings (structures that look like cycles) present in kinship net-works. For this goal, we came across the following question: for all vertex v of a vertex-colored digraph, how many colors (in maximum) a path starting in v can have? The answer for this question would help us to enumerate the colored rings since we would know how many colors a ring evolving some vertices could have, in maximum. Here, we call a path as v-super-colored if it starts in vertex v and it has the maximum amount of colors among all paths star
APA, Harvard, Vancouver, ISO, and other styles
6

Wani, M. F. "Life Cycle Design and Evaluation at Conceptual Design Stage Using Digraph and Matrix Approach." In ASME 8th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2006. http://dx.doi.org/10.1115/esda2006-95734.

Full text
Abstract:
In this paper, a procedure based on digraph and matrix approach is presented for carrying out life cycle design and evaluation of mechanical systems, at system conceptual design stage. Features which characterize life cycle aspects of the system are identified and are called attributes of life cycle of a the system. Consideration of these attributes and their interrelations are rudiment in design and evaluation of life cycle of the system. This is modeled in terms of life cycle Design (LCD) attributes digraph for the system. Nodes in the digraph represent attributes and their relations are rep
APA, Harvard, Vancouver, ISO, and other styles
7

Belardo, Francesco, Enzo M. Li Marzi, Slobodan K. Simić, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Schwenk-Like Formulas for Weighted Digraphs." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2009: Volume 1 and Volume 2. AIP, 2009. http://dx.doi.org/10.1063/1.3241302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Permana, Virdiansyah, and Rahmat Shoureshi. "Controllability and Observability of a Large Scale Thermodynamical System via Connectability Approach." In ASME 2010 Dynamic Systems and Control Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/dscc2010-4265.

Full text
Abstract:
This study presents a new approach to determine the controllability and observability of a large scale nonlinear dynamic thermal system using graph-theory. The novelty of this method is in adapting graph theory for nonlinear class and establishing a graphic condition that describes the necessary and sufficient terms for a nonlinear class system to be controllable and observable, which equivalents to the analytical method of Lie algebra rank condition. The directed graph (digraph) is utilized to model the system, and the rule of its adaptation in nonlinear class is defined. Subsequently, necess
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Tongquan, and Ying Yin. "Travelling Production Line Problem on Digraphs with Parameterized Triangle Inequality." In 2010 International Conference on Computational Intelligence and Software Engineering (CiSE). IEEE, 2010. http://dx.doi.org/10.1109/cise.2010.5676930.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shoureshi, Rahmat, and Virdi Permana. "Connectability-Based Controllability of Large Scale Nonlinear Dynamic Thermal Systems." In ASME 2009 Dynamic Systems and Control Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/dscc2009-2783.

Full text
Abstract:
A new approach using graph-theory to determine the controllability and observability of large scale nonlinear dynamic thermal systems is presented. The novelty of this method is in adapting graph theory for a nonlinear class and establishing graphic conditions that describe the necessary and sufficient conditions for a class of nonlinear systems to be controllable and observable which is equivalent to the analytical method of Lie algebra rank condition. Graph theory of directed graph (digraph) is utilized to model the system and its adaptation to nonlinear problems is defined. The necessary an
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Line digraph' for particular source types:
Journal articles
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!

To the bibliography