• No results found

Line graphs

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

... of graphs, say in terms of a minimal set of localized “orbitals” each taken as a vertex, with edges identified to stronger interactions between pairs of ...para-line graphs with vertices ...

15

SINGLE-VALUED NEUTROSOPHIC LINE GRAPHS

SINGLE-VALUED NEUTROSOPHIC LINE GRAPHS

... fuzzy graphs was initiated by Kaufmann [11], based on Zadeh’s fuzzy ...fuzzy graphs. Some remarks on fuzzy graphs were given by Bhattacharya ...Fuzzy line graphs were studied in [12] by ...

12

On the Planarity of  Generalized Line Graphs

On the Planarity of Generalized Line Graphs

... a line graph if there exists a graph H such that G = L ( H ...of line graphs is probably a forbidden subgraph characterization due to Beineke ...of graphs whose line graph is ...

11

Hamiltonian Laceability in Line Graphs

Hamiltonian Laceability in Line Graphs

... A Connected graph G is a Hamiltonian laceable if there exists in G a Hamiltonian path between every pair of vertices in G at an odd distance. G is a Hamiltonian-t-Laceable (Hamiltonian- t*-Laceable) if there exists in G ...

9

On two energy like invariants of line graphs and related graph operations

On two energy like invariants of line graphs and related graph operations

... Next, we turn our attention to the case of para-line graphs. Notice that if G is r-regular, then C (G) is also r-regular, and hence it follows from Lemma . that the Laplacian eigen- values of C(G) are r + ...

15

Line graphs associated to the maximal graph

Line graphs associated to the maximal graph

... the line graph of a given graph G, is denoted by L(G) and is defined as a graph such that each vertex of L(G) repre- sents an edge of G and any two vertices of L(G) are adjacent if and only if their corresponding ...

11

Old and new generalizations of line graphs

Old and new generalizations of line graphs

... triangle graphs are a special case of clique graphs, a more general variation on line ...clique graphs and some other ...the line graph L(G) of a graph G is obtained when one considers ...

13

On k-Minimally Nonouterplanarity of Line Graphs

On k-Minimally Nonouterplanarity of Line Graphs

... Abstract. A graph is said to be embedded in a surface S when it is drawn on S so that no two lines intersect. A graph is planar if it can be embedded in the plane. In this paper, we obtain results on plane embedding of a ...

5

Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs

Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs

... the line graph of a (hyper)graph captures richer (hyper)graph char- acteristics than the (hyper)graph spectral representations and also avoids the spectral truncation arising in TLS and ...directed line ...

7

Improving the Accessibility of Line Graphs in Multimodal Documents

Improving the Accessibility of Line Graphs in Multimodal Documents

... This paper presented our system for providing ac- cess to the full content of multimodal documents with line graphs in popular media. Such graph- ics generally have a high-level communicative goal which ...

11

A Corpus of Human written Summaries of Line Graphs

A Corpus of Human written Summaries of Line Graphs

... Prior to this study, we performed an initial investi- gation based on a questionnaire similar to the one used by Demir (2010) for bar charts. A group of human subjects was asked to review several line ...

5

Depth-based Hypergraph Complexity Traces from Directed Line Graphs

Depth-based Hypergraph Complexity Traces from Directed Line Graphs

... undirected graphs can be extended to directed ...directed line graphs depends on the in-degree and out-degree of pairs of vertices connected by ...

38

Abstractive Summarization of Line Graphs from Popular Media

Abstractive Summarization of Line Graphs from Popular Media

... Our work is concerned with the summarization of information graphics from popular media. Such summaries have several major applications: 1) they can be integrated with the summary of a multimodal document’s text, thereby ...

8

On the F-index and F-coindex of the line graphs of the subdivision graphs

On the F-index and F-coindex of the line graphs of the subdivision graphs

... of line graphs and that of line graphs of subdivision graphs of well known classes of graphs have been subject to study of molecular graph theory by many ...the line ...

7

A Study on Spectrum of Regular Graphs and Line Graphs

A Study on Spectrum of Regular Graphs and Line Graphs

... Regular graphs and Line graphs” is prepared after a deep study on certain concepts of Graph ...regular graphs and line graphs discussion is ...a line graph there is a ...

7

Word Representability of Line Graphs

Word Representability of Line Graphs

... prove a stronger result, which is that (where denotes the line graph of ) is non-repre- sentable for . From the non-representability of we are led to a more general theorem regarding line graphs. Our ...

6

Tables & Line Graphs

Tables & Line Graphs

... Maria and Vinny collected stamps from three different countries: Singapore, Malaysia, and Thailand.. The number of stamps collected is shown in the table below?[r] ...

16

A NOTE ON LINE GRAPHS

A NOTE ON LINE GRAPHS

... Devanaboina Srinivasulu is post graduated from Acharya Nagarjuna Univer- sity. He is presently working as assistant professor in the Department of BSH, NRI Institute of Technology, Agiripalli 521 212, AP, INDIA. He is ...

7

Line Graphs and Quasi Total Graphs

Line Graphs and Quasi Total Graphs

... and „‟ denotes the ring sum operation on graphs. The number of connected components in G is equal to the number of connected components in L(G) and also if G is a cycle of length n, then L(G) is also a cycle of ...

5

Forbidden 3 Colored Posets of Cover Incomparable Line Graphs

Forbidden 3 Colored Posets of Cover Incomparable Line Graphs

... conclude that there must be a dashed line between v and z representing a chain of length 3 between v and z. Here y and x can have both possibilities, namely y ⊲ x or y || x and hence the edge xy can also be ...

8

Show all 10000 documents...

Related subjects