DOCSLIB.ORG

Graphs and Digraphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graphs and Digraphs CIT 596 – Theory of Computation 1 Graphs and Digraphs A graph G = (V (G),E(G)) consists of two finite sets: • V (G), the vertex set of the graph, often denoted by just V , which is a nonempty set of elements called vertices, and • E(G), the edge set of the graph, often denoted by just E, which is a possibly empty set of elements called edges, such that each edge e in E is assigned an unordered pair (u, v) of vertices, called the end vertices of e. Sometimes, it is convenient to denote (u, v) by simply uv, or equivalently, vu. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 2 Graphs and Digraphs Consider the graph G = (V,E) such that V = {a,b,c,d,e} and E = {e1, e2, e3, e4, e5, e6, e7, e8}, where e1 ←→ (a,b) e2 ←→ (b, c) e3 ←→ (c, c) e4 ←→ (c, d) e5 ←→ (b,d) e6 ←→ (d, e) e7 ←→ (b, e) e8 ←→ (b, e) °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 3 Graphs and Digraphs A graph is often represented by a diagram in which vertices are drawn as circles and edges as line or curve segments joining the circles repre- senting the end vertices of the edge. e8 e1 a b e e7 e2 e6 e5 e3 c d e4 °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 4 Graphs and Digraphs Vertices are also called points, nodes, or just dots. If e is an edge with end vertices u and v then e is said to join u and v. Note that the definition of a graph allows the possibility of the edge e having idetical end vertices, i.e., it is possible to have a vertex u joined to itself by an edge — such an edge is called a loop. If two (or more) edges have the same end vertices then edges are called parallel. A graph is called simple is it has no loops and no parallel edges. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 5 Graphs and Digraphs For an example of a simple graph, consider the graph G = (V,E) such that V = {a,b,c,d} and E = {e1, e2, e3, e4}, where e1 ←→ (a,b) e2 ←→ (a, c) e3 ←→ (b, c) e4 ←→ (c, d) Some authors use the term multigraph for graphs with loops and parallel edges, and reserve the term graph for simple graphs only. Since we will deal with graphs with loops very often, it is more convenient not to make this distinction. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 6 Graphs and Digraphs A pictorial representation of the simple graph G in the previous slide: e1 a b e2 e3 c e4 d °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 7 Graphs and Digraphs The number of vertices in G is called the order of G. The number of edges in G is called the size of G. Two vertices u and v of a graph G are said to be adjacent if uv ∈ E(G). If uv 6∈ E(G) then we say that u and v are non-adjacent vertices. An edge e of a graph G is said to be incident with or incident to the vertex v if v is an end vertex of e. In this case, we also say that v is incident with or incident to e. Two edges e and f which are incident with a common vertex v are said to be adjacent. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 8 Graphs and Digraphs Let v be a vertex of the graph G. The degree d(v) of v is the number of edges of G incident to v, counting each loop twice, i.e., it is the number of times v is an end vertex of an edge. b e a c d For example, d(a) = 1, d(b) = 3, d(c) = 3, d(d) = 3, and d(e) = 4 in the graph above. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 9 Graphs and Digraphs The First Theorem of Graph Theory. For any graph G with ne edges and nv vertices v1,...,vnv, we have that nv X d(vi) = 2 · ne. i=1 Check by yourself: b e a c d °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 10 Graphs and Digraphs A walk in a graph G is a finite sequence W = v0e1v1e2v2 ...vk−1ekvk whose terms are alternately vertices and edges such that, for 1 ≤ i ≤ k, the edge ei has end vertices vi−1 and vi. We say that the above walk is a v0–vk walk or a walk from v0 to vk. The integer k, the number of edges of the walk, is called the length of W . A trivial walk is one containing no edges. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 11 Graphs and Digraphs The sequence c e2 b e8 f e6 c e3 d e4 e e4 d is a c–d walk of length 6 in the graph below. b d e e1 2 e3 a e8 c e4 e7 e e6 5 f e In a simple graph, a walk is determined by the sequence of vertices only: cbfcded. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 12 Graphs and Digraphs Given two vertices u and v of a graph G, a u–v walk is called closed or open depending on whether u = v or u 6= v. If the edges e1, e2,...,ek of the walk v0e1v1e2v2 ...vk−1ekvk are dis- tinct then W is called a trail. If the vertices v0, v1,...,vk of the walk v0e1v1e2v2 ...vk−1ekvk are distinct then W is called a path. For the graph in the previous slide, fbcdec is a f–c trail, but not a path! The sequence fbcde is a f–e path. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 13 Graphs and Digraphs A vertex u is said to be connected to a vertex v in a graph G if there is a path in G from u to v. A graph G is connected if every two vertices of G are connected; oth- erwise, G is disconnected. M N b d b a c a c Connected Disconnected °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 14 Graphs and Digraphs A nontrivial closed trail C = v1v2 ...vnv1 in a graph G is called a cycle if the vertices v2 ...vn are all distinct. A cycle of length k, i.e., a cycle with k edges, is called a k-cycle. For example, bcfb is a 3-cycle in the graph below: b d e e1 2 e3 a e8 c e4 e7 e e6 5 f e °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 15 Graphs and Digraphs A graph G is said to be acyclic if it contains no cycles. A graph G is called a tree if it is connected and acyclic. a b c d e The vertices of degree (at most) 1 in a tree are called the leaves of the tree. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 16 Graphs and Digraphs A directed graph (or simply digraph) D = (V (D),A(D)) consists of two finite sets: • V (D), the vertex set of the digraph, often denoted by just V , which is a nonempty set of elements called vertices, and • A(D), the arc set of the digraph, often denoted by just A, which is a possibly empty set of elements called arcs, such that each arc a in A is assigned a (ordered) pair (u, v) of vertices. If a is an arc in D with associated ordered pair of vertices (u, v), then a is said to join u to v, u is called the initial vertex of a, and v is called the terminal vertex of a. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 17 Graphs and Digraphs For example, consider the digraph D = (V (D),A(D)) such that V (D) = {a,b,c,d,e} and A(D) = {e1, e2, e3, e4, e5, e6}, such that e1 ←→ (b, c), e2 ←→ (d, c), e3 ←→ (c, d), e3 ←→ (d, e), e4 ←→ (e, d), and e6 ←→ (e, e). e6 a b e e1 e5 e4 e2 c d e3 °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 18 Graphs and Digraphs Let D be a digraph. Then a directed walk in D is a finite sequence W = v0a1v1 ...akvk, whose terms are alternately vertices and arcs such that for 1 ≤ i ≤ k, the initial vertex of the arc ai is vi−1 and its terminal vertex is vi. The number k of arcs is the length of W . The walk W given in the definition above is said to be a v0–vk directed walk or a directed walk from v0 to vk. There are similar definitions for directed trails, directed paths, and di- rected cycles. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 19 Graphs and Digraphs For example, consider the digraph D below: e6 a b e e1 e5 e4 e2 c d e3 The sequence b e1 c e3 d e4 e is a b–e directed walk, a b–e directed trail, and a b–e directed path in D. °c Marcelo Siqueira — Spring 2005 CIT 596 – Theory of Computation 20 Graphs and Digraphs A vertex v of the digraph D is said to be reachable from a vertex u if there is a directed path from u to v.
Load more

Recommended publications
  • Directed Graph Algorithms
    Directed Graph Algorithms CSE 373 Data Structures Readings • Reading Chapter 13 › Sections 13.3 and 13.4 Digraphs 2 Topological Sort 142 322 143 321 Problem: Find an order in which all these courses can 326 be taken. 370 341 Example: 142 Æ 143 Æ 378 Æ 370 Æ 321 Æ 341 Æ 322 Æ 326 Æ 421 Æ 401 378 421 In order to take a course, you must 401 take all of its prerequisites first Digraphs 3 Topological Sort Given a digraph G = (V, E), find a linear ordering of its vertices such that: for any edge (v, w) in E, v precedes w in the ordering B C A F D E Digraphs 4 Topo sort – valid solution B C Any linear ordering in which A all the arrows go to the right F is a valid solution D E A B F C D E Note that F can go anywhere in this list because it is not connected. Also the solution is not unique. Digraphs 5 Topo sort – invalid solution B C A Any linear ordering in which an arrow goes to the left F is not a valid solution D E A B F C E D NO! Digraphs 6 Paths and Cycles • Given a digraph G = (V,E), a path is a sequence of vertices v1,v2, …,vk such that: ›(vi,vi+1) in E for 1 < i < k › path length = number of edges in the path › path cost = sum of costs of each edge • A path is a cycle if : › k > 1; v1 = vk •G is acyclic if it has no cycles.
    [Show full text]
  • Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities
    Discussiones Mathematicae General Algebra and Applications 40 (2020) 143–157 doi:10.7151/dmgaa.1344 GRAPH VARIETIES AXIOMATIZED BY SEMIMEDIAL, MEDIAL, AND SOME OTHER GROUPOID IDENTITIES Erkko Lehtonen Technische Universit¨at Dresden Institut f¨ur Algebra 01062 Dresden, Germany e-mail: [email protected] and Chaowat Manyuen Department of Mathematics, Faculty of Science Khon Kaen University Khon Kaen 40002, Thailand e-mail: [email protected] Abstract Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph varieties axiomatized by certain groupoid identities (medial, semimedial, autodis- tributive, commutative, idempotent, unipotent, zeropotent, alternative). Keywords: graph algebra, groupoid, identities, semimediality, mediality. 2010 Mathematics Subject Classification: 05C25, 03C05. 1. Introduction Graph algebras were introduced by Shallon [10] in 1979 with the purpose of providing examples of nonfinitely based finite algebras. Let us briefly recall this concept. Given a directed graph G = (V, E) without multiple edges, the graph algebra associated with G is the algebra A(G) = (V ∪ {∞}, ◦, ∞) of type (2, 0), 144 E. Lehtonen and C. Manyuen where ∞ is an element not belonging to V and the binary operation ◦ is defined by the rule u, if (u, v) ∈ E, u ◦ v := (∞, otherwise, for all u, v ∈ V ∪ {∞}. We will denote the product u ◦ v simply by juxtaposition uv. Using this representation, we may view any algebraic property of a graph algebra as a property of the graph with which it is associated.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
    [Show full text]
  • Structural Graph Theory Meets Algorithms: Covering And
    Structural Graph Theory Meets Algorithms: Covering and Connectivity Problems in Graphs Saeed Akhoondian Amiri Fakult¨atIV { Elektrotechnik und Informatik der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften Dr. rer. nat. genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Rolf Niedermeier Gutachter: Prof. Dr. Stephan Kreutzer Gutachter: Prof. Dr. Marcin Pilipczuk Gutachter: Prof. Dr. Dimitrios Thilikos Tag der wissenschaftlichen Aussprache: 13. October 2017 Berlin 2017 2 This thesis is dedicated to my family, especially to my beautiful wife Atefe and my lovely son Shervin. 3 Contents Abstract iii Acknowledgementsv I. Introduction and Preliminaries1 1. Introduction2 1.0.1. General Techniques and Models......................3 1.1. Covering Problems.................................6 1.1.1. Covering Problems in Distributed Models: Case of Dominating Sets.6 1.1.2. Covering Problems in Directed Graphs: Finding Similar Patterns, the Case of Erd}os-P´osaproperty.......................9 1.2. Routing Problems in Directed Graphs...................... 11 1.2.1. Routing Problems............................. 11 1.2.2. Rerouting Problems............................ 12 1.3. Structure of the Thesis and Declaration of Authorship............. 14 2. Preliminaries and Notations 16 2.1. Basic Notations and Defnitions.......................... 16 2.1.1. Sets..................................... 16 2.1.2. Graphs................................... 16 2.2. Complexity Classes................................
    [Show full text]
  • Katz Centrality for Directed Graphs • Understand How Katz Centrality Is an Extension of Eigenvector Centrality to Learning Directed Graphs
    Prof. Ralucca Gera, [email protected] Applied Mathematics Department, ExcellenceNaval Postgraduate Through Knowledge School MA4404 Complex Networks Katz Centrality for directed graphs • Understand how Katz centrality is an extension of Eigenvector Centrality to Learning directed graphs. Outcomes • Compute Katz centrality per node. • Interpret the meaning of the values of Katz centrality. Recall: Centralities Quality: what makes a node Mathematical Description Appropriate Usage Identification important (central) Lots of one-hop connections The number of vertices that Local influence Degree from influences directly matters deg Small diameter Lots of one-hop connections The proportion of the vertices Local influence Degree centrality from relative to the size of that influences directly matters deg C the graph Small diameter |V(G)| Lots of one-hop connections A weighted degree centrality For example when the Eigenvector centrality to high centrality vertices based on the weight of the people you are (recursive formula): neighbors (instead of a weight connected to matter. ∝ of 1 as in degree centrality) Recall: Strongly connected Definition: A directed graph D = (V, E) is strongly connected if and only if, for each pair of nodes u, v ∈ V, there is a path from u to v. • The Web graph is not strongly connected since • there are pairs of nodes u and v, there is no path from u to v and from v to u. • This presents a challenge for nodes that have an in‐degree of zero Add a link from each page to v every page and give each link a small transition probability controlled by a parameter β. u Source: http://en.wikipedia.org/wiki/Directed_acyclic_graph 4 Katz Centrality • Recall that the eigenvector centrality is a weighted degree obtained from the leading eigenvector of A: A x =λx , so its entries are 1 λ Thoughts on how to adapt the above formula for directed graphs? • Katz centrality: ∑ + β, Where β is a constant initial weight given to each vertex so that vertices with zero in degree (or out degree) are included in calculations.
    [Show full text]
  • A Gentle Introduction to Deep Learning for Graphs
    A Gentle Introduction to Deep Learning for Graphs Davide Bacciua, Federico Erricaa, Alessio Michelia, Marco Poddaa aDepartment of Computer Science, University of Pisa, Italy. Abstract The adaptive processing of graph data is a long-standing research topic that has been lately consolidated as a theme of major interest in the deep learning community. The snap increase in the amount and breadth of related research has come at the price of little systematization of knowledge and attention to earlier literature. This work is a tutorial introduction to the field of deep learn- ing for graphs. It favors a consistent and progressive presentation of the main concepts and architectural aspects over an exposition of the most recent liter- ature, for which the reader is referred to available surveys. The paper takes a top-down view of the problem, introducing a generalized formulation of graph representation learning based on a local and iterative approach to structured in- formation processing. Moreover, it introduces the basic building blocks that can be combined to design novel and effective neural models for graphs. We com- plement the methodological exposition with a discussion of interesting research challenges and applications in the field. Keywords: deep learning for graphs, graph neural networks, learning for structured data arXiv:1912.12693v2 [cs.LG] 15 Jun 2020 1. Introduction Graphs are a powerful tool to represent data that is produced by a variety of artificial and natural processes. A graph has a compositional nature, being a compound of atomic information pieces, and a relational nature, as the links defining its structure denote relationships between the linked entities.
    [Show full text]
  • Rank of Weighted Digraphs with Blocks
    Rank of weighted digraphs with blocks∗ Ranveer Singh† Swarup Kumar Panda ‡ Naomi Shaked-Monderer§ Abraham Berman¶ October 10, 2018 Abstract Let G be a digraph and r(G) be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a digraph using the ranks of its blocks. In particular, we define classes of digraphs, namely r2-digraph, and r0-digraph, for which the rank can be exactly determined in terms of the ranks of subdigraphs of the blocks. Furthermore, the rank of directed trees, simple biblock graphs, and some simple block graphs are studied. Keywords: r2-digraphs, r0-digraphs, tree digraphs, block graphs, biblock graphs AMS Subject Classifications. 15A15, 15A18, 05C50 1 Introduction A well-known problem, proposed in 1957 by Collatz and Sinogowitz, is to characterize graphs with positive nullity [19]. Nullity of graphs is applicable in various branches of science, in particular, quantum chemistry, H¨uckel molecular orbital theory [10], [13] and social network theory [14]. For more detail on the applications see [10]. Many significant results on the nullity of undirected graphs are available in the literature, see [4, 7, 11, 12, 15, 12, 2, 3, 20]. Recently in [9, 8, 6] nullity of undirected graphs was studied using cut-vertices and connected components. The results are used to calculate the nullity of line graphs of undirected graphs. Apart from the connected components, it turns out that the blocks are also interesting subgraphs of a graph, which can be utilized to know its determinant [17, 16].
    [Show full text]
  • 31 Vowel Digraph Oo
    Sort Vowel Digraph oo 31 Objectives • To identify spelling patterns of vowel digraph oo Words • To read, sort, and write words with vowel digraph oo o˘o oˉo = uˉ Oddball brook nook fool spool could Materials for Within Word Pattern crook soot groom spoon should Big Book of Rhymes, “The Puppet Show,” page 55 foot stood hoop stool would hood wood noon tool Whiteboard Activities DVD-ROM, Sort 31 hook wool root troop Teacher Resource CD-ROM, Sort 31 and Follow the Dragon Game Student Book, pages 121–124 Words Their Way Library, The House That Stood on Booker Hill Introduce/Model Small Groups • Read a Rhyme Read “The Puppet Show,” and Extend the Sort emphasize words with the vowel digraph oo. (wood, book, took; soon, noon) Ask students to locate these Alternative Sort: Brainstorming words, and help them write the words in two columns, Ask students to think of other words that contain according to vowel sound. Help students hear the oo. Write their responses on index cards. When different pronunciations of the vowel digraph oo. students have completed brainstorming, ask them to identify and sort all the words they named • Model Use the whiteboard DVD or the CD word according to the vowel sound of oo. cards. Define in context any that may be unfamiliar to students. Demonstrate how to sort the words ELL English Language Learners according to the sound of the digraph oo. Point out Explain that a nook is “a hidden place,” and that that would, could, and should do not contain the groom can have several meanings, including “a digraph oo, so they belong in the oddball category.
    [Show full text]
  • Graph Mining: Social Network Analysis and Information Diffusion
    Graph Mining: Social network analysis and Information Diffusion Davide Mottin, Konstantina Lazaridou Hasso Plattner Institute Graph Mining course Winter Semester 2016 Lecture road Introduction to social networks Real word networks’ characteristics Information diffusion GRAPH MINING WS 2016 2 Paper presentations ▪ Link to form: https://goo.gl/ivRhKO ▪ Choose the date(s) you are available ▪ Choose three papers according to preference (there are three lists) ▪ Choose at least one paper for each course part ▪ Register to the mailing list: https://lists.hpi.uni-potsdam.de/listinfo/graphmining-ws1617 GRAPH MINING WS 2016 3 What is a social network? ▪Oxford dictionary A social network is a network of social interactions and personal relationships GRAPH MINING WS 2016 4 What is an online social network? ▪ Oxford dictionary An online social network (OSN) is a dedicated website or other application, which enables users to communicate with each other by posting information, comments, messages, images, etc. ▪ Computer science : A network that consists of a finite number of users (nodes) that interact with each other (edges) by sharing information (labels, signs, edge directions etc.) GRAPH MINING WS 2016 5 Definitions ▪Vertex/Node : a user of the social network (Twitter user, an author in a co-authorship network, an actor etc.) ▪Edge/Link/Tie : the connection between two vertices referring to their relationship or interaction (friend-of relationship, re-tweeting activity, etc.) Graph G=(V,E) symbols meaning V users E connections deg(u) node degree:
    [Show full text]
  • A Faster Parameterized Algorithm for PSEUDOFOREST DELETION
    A faster parameterized algorithm for PSEUDOFOREST DELETION Citation for published version (APA): Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). A faster parameterized algorithm for PSEUDOFOREST DELETION. Discrete Applied Mathematics, 236, 42-56. https://doi.org/10.1016/j.dam.2017.10.018 Document license: Unspecified DOI: 10.1016/j.dam.2017.10.018 Document status and date: Published: 19/02/2018 Document Version: Accepted manuscript including changes made at the peer-review stage Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Locutour Guide to Letters, Sounds, and Symbols
    LOCUTOUROUR® Guide to Letters, Sounds, and Symbols LOCUTOUR ABEL LASSIFICATION LACE OR RTICULATION PELLED AS XAMPLES S PELLINGP E L L I N G L C P A IPA S E Consonants p bilabial plosive voiceless lips /p/ p, pp pit, puppy b bilabial plosive voiced lips /b/ b, bb bat, ebb t lingua-alveolar plosive voiceless tongue tip + upper gum ridge /t/ t, ed, gth, th, tt, tw tan, tipped, tight, thyme, attic, two d lingua-alveolar plosive voiced tongue tip + upper gum ridge /d/ d, dd, ed dad, ladder, bagged k lingua-velar plosive voiceless back of tongue and soft palate /k/ c, cc, ch, ck cab, occur, school, duck que, k mosque, kit g lingua-velar plosive voiced back of tongue and soft palate /g/ g, gg, gh, gu, gue hug, bagged, Ghana, guy, morgue f labiodental fricative voiceless lower lip + upper teeth /f/ f, ff , gh, ph feet, fl u uff, enough, phone v labiodental fricative voiced lower lip + upper teeth /v/ v, vv, f, ph vet, savvy, of, Stephen th linguadental fricative voiceless tongue + teeth /T/ th thin th linguadental fricative voiced tongue + teeth /D/ th, the them, bathe s lingua-alveolar fricative voiceless tongue tip + upper gum ridge or /s/ s, ss, sc, ce, ci, sit, hiss, scenic, ace, city tongue tip + lower gum ridge cy, ps, z cycle, psychology, pizza z lingua-alveolar fricative voiced tongue tip + upper gum ridge or /z/ z, zz, s, ss, x, cz Zen, buzz, is, scissors, tongue tip + lower gum ridge Xerox, czar sh linguapalatal fricative voiceless tongue blade and hard palate /S/ sh, ce, ch, ci, sch, si, sheep, ocean, chef, glacier, kirsch ss, su,
    [Show full text]
  • Quick Notes on Nodexl
    Quick notes on NodeXL Programme organisation, 3 components: • NodeXL command ‘ribbon’ – access with menu-like item at top of the screen, contains all network data functions • Data sheets – 5 separate sheets for edges, vertices, metrics etc, switching between them using tabs on the bottom. NB because the screen gets quite crowded the sheet titles sometimes disappear off to one side so use the small arrows (bottom left) to scroll across the tabs if something seems to have gone missing. • Graph viewer – separate window pane labelled ‘Document Actions’ with graphical layout functions. Can be closed while working with data – to open it again click the ‘Show Graph’ button near the left-hand side of the ribbon. Working with data, basic process: 1. Start in ‘Edges’ data sheet (leftmost tab at the bottom); each row represents one connection of the form A links to B (directed graph) OR A and B are linked (undirected). (Directed/Undirected changed in ‘Type’ option on ribbon. In directed graph this sheet might include one row for A->B and one for B->A; in an undirected graph this would be tautologous.) No other data in this sheet is required, although optionally: • Could include text under ‘label’ if the visible label on graphs should be different from the name used in columns A or B. NB These might be overwritten when using ‘autofill columns’. • Could add an extra column at column L to identify weight of links if (as is the case with IssueCrawler data) each connection might represent more than 1 actually existing link between two vertices, hence inclusion of ‘Edge Weight’ in blogs data.
    [Show full text]